2. (60 points)* Hash tables are good for symbol lookup but not for sorting or ranking. The internal sorting methods we've discussed in class are good for ordering keys but not for fast lookup as in hash tables. However, in many real-world applications, we need both fast lookup and ranking. For example, in every meeting to determine student scholarship, we need both ranking of student performance based on GPA and fast lookup for student records. (a) Design a data structure and associated algorithms that can be used as a hash table for fast symbol lookup as well as a structure that maintains elements in sorted order. (b) Write a complete C++ program for the data structure and testing of your design in (a). *: 60 points for solving any one of the two problems above with a total of 100 points. 2. (60 points)* Hash tables are good for symbol lookup but not for sorting or ranking. The internal sorting methods we've discussed in class are good for ordering keys but not for fast lookup as in hash tables. However, in many real-world applications, we need both fast lookup and ranking. For example, in every meeting to determine student scholarship, we need both ranking of student performance based on GPA and fast lookup for student records. (a) Design a data structure and associated algorithms that can be used as a hash table for fast symbol lookup as well as a structure that maintains elements in sorted order. (b) Write a complete C++ program for the data structure and testing of your design in (a). *: 60 points for solving any one of the two problems above with a total of 100 points