Dictionaries 29. Suppose we implement a dictionary ADT using a standard linked list. What is the asymptotic running time of the Find operation? 30. What is the worst-case asymptotic running time for deleting an element from a hash table containing n items? 31. What is the expected running time to returning the minimum value stored in a hash table with l locations and n values? min heap. 33. HeapSort is a sorting algorithm that inserts n items into a standard binary min-heap, and then pops them off one at a time, in ascending order. In asymptotic notation, how much space does HeapSort require to sort n elements? 34. In asymptotic notation, how long does it take to find the minimum value in a binary search tree containing n elements