Problem
1. Write a Java class that implements all the methods of the ordered dictionary ADT by means of an (a, b) tree, where a and b are integer constants passed as parameters to a constructor.
2. Implement the B-tree data structure, assuming a block size of 1,024 and integer keys. Test the number of "disk transfers" needed to process a sequence of dictionary operations.
3. Implement an external-memory sorting algorithm and compare it experimentally to any of the internal-memory sorting algorithms described in this book.