Explain each answer

5. Explain in one sentence why each of the following is a property of a good hash function: a) Fast fo compute b) Rarely causes collisions c) The same keys hash to the same value 6. Assume that you have an array of Strings representing words from the English language. The length of the array is N. You are tasked with finding the word with the maximum and minimum frequency. Describe an algorithm where this can be done in O(N) using a hash table. Assume that you have an array of unique integers. The length of the array is N. You are tasked with finding two integers in this array such that their sum is equal to a provided target integer. Describe an algorithm where this can be done in O(N) using a hash table. You can assume that exactly one pair of elements in the array sums to the provided target integer. 7. 8. The maximum number of nodes that can be present in a binary tree with depth n (Assume root is at depth 0) are: NOTE: You need to provide the proof of your result (i.e., you need to derive the result)