Hash Tables (20 points) Given an input in the order of (37, 25, 73, 49, 55, 67, 26, 95} and a hash function h(x)-x (mod 11) Show the result of quadratic open addressing probing algorithm. (10 pts) Show the resulting of open addressing hash table with second hash function h2(x)-5-(x mod 5). (10 pts) Heap (20 points) How many calls of TricleDown (the method) must be made to Max-heapify the following array x? Show array x after each of the TricleDown call. X[i] 15 30 23 31 40 27751 16