1. Determine the worst case time complexity for each method of the Map ADT implemented in Section 3.2.
2. Modify the binary search algorithm to find the position of the first occurrence of a value that can occur multiple times in the ordered list. Verify your algorithm is still O(log n).