26. (5 points) You are tasked by your computer-illiterate boss with selecting and implementing a data structure to store student records, using the students' names as keys (assume every nae s unique). You know in advance roughly how many students there will be, and you need the insertion and retrieval of records to be as fast as possible, on average. Tell us which of the data structures we discussed this term you would choose, and justify your selection by discussing its performance for this task as compared to some other data structure. 27. (5 points) Your stupid boss has changed his mind and decided to use students' ID numbers (a 6-digit integer) as keys. Once again, it is a priority that insertion and retrieval of records be fast, but now, he wants to be able to retrieve a range of records by giving a lower and upper bounds on the ID numbers. Tell us which of the data structures we discussed this term you would choose, and justify your selection by discussing its performance for this task as compared to some other data structure. 28. (4 points) One more time, your stupid boss has changed the requirements on your project: he still wants to use students' ID numbers as keys. Once again, it is a priority that insertion and retrieval of records be fast, but now, instead of being able to retrieve ranges, he wants the system to be really fast at repeatedly retrieving some specific subset of the records on any given day. Tell us which of the data structures we discussed this term you would choose, and justify your selection by discussing its performance for this task as compared to some other data structure