The CS department wants to maintain a database of up to 2900 UINs of students who have taken CS 225 so that it can be determined very quickly whether or not a given student has taken the course. Speed of response is very important; but not as important as efficient use of memory. To be more specific, we would like to be able to do our lookup in O(1) time, and use no more memory than necessary to do so. Which of the following data structures would be most appropriate for this task? a. A sorted linked list
b. A sorted array with 2900 entries
c. A hash table using probing with capacity 100000
d. A hash table using probing with capacity 4500
e. A hash table using probing with capacity 2900