Circle T or F for each of the following statements to indicate whether the statement is true or false, respectively. a) Heap sort can sort an array in place
b) For a dynamic programming algorithm, computing all values in a bottom up fashion is asymptotically faster than using top-down recursion and memorization.
c) It is not possible to have different keys being hashed to the same position in a hash table.
d) An ideal hash table has average-case time complexity of O(l) for lookups.