35. Let H be a hash table with 2018 slots with a hash function h(x) with the uniform hashing property. Given an item r, what is the probability it hashes to the 17th location? 36. Let H be a hash table with 2018 slots with a hash function h(a with the uniform hashing property. Given two items z, y, what is the probability that they hash to the same location? 37. Using asymptotic notation, for what value of the load factor does a hash table become inefficient relative to a red-black tree? 38. Suppose we initialize an empty dynamically resizing hash table H, and each time every location contains k expected items (for k constant) we do the size-doubling operation on H. In asymptotic notation, what is the cost of inserting n items into H? Greedy algorithms and Huffman encoding 39. True or false: greedy algorithms require a problem to have optimal substructure 40. True or false: InsertionSort is agreedy algorithm 41. True or false: greedy algorithms, if they are correct, are always optimal 42. True or false: greedy algorithms are a special case of dynamic programming