1. Implement a new version of the Map ADT from Section 3.2 to use a sorted list and the binary search algorithm.

2. The implementation of the Sparse Matrix ADT from Chapter 4 can be improved by storing the MatrixElement objects in a sorted list and using the binary search to locate a specific element. The matrix elements can be sorted based on the row and column indices using an index function similar to that used with a 2-D array stored in a MultiArray. Implement a new version of the Sparse Matrix ADT using a sorted list and the binary search to locate elements.