Below, for each situation described in the left column, select the most appropriate data structure to use from the right column. You do not know the total number of items (keys) to be inserted, but you may assume that both hashCode and compareTo are fast (constant time). Note: Some may be used more than once while others might not be used at all. You need to provide put(key, value), get(key) and delete(key) operations and you want them to be as fast as possible on average. You need to provide put(key, value), get(key), and delete(key) operations and you want them to be as fast as possible, but you must guarantee that these operations never take linear time. 1. SequentialSearchST (unsorted linked list) 2. BinarySearchST (sorted array) 3. BinarySearchTree In addition to put(key, value), get(key), and delete(key) operations, you need to periodically provide the list of keys in order from most recently inserted (newest) to least recently inserted(oldest). The list of keys from newest to oldest must be provided as fast as possible. 4. RedBlackBST 5. Linear Probing HashST In addition to put(key, value), get(key) and delete(key), you need to periodically provide the list of keys in order from smallest to greatest. This list should be constructed in no more than linear time while keeping the other operations as fast as possible.