min-heap. Analyze its complexity. Justify. Problem #3: (a) Show the result (only the array representation) of converting the following list of integer into a min-heap. L (15, 10, 13, 9,6, 7, 8,17,8,5) (b) Show the resulting heap (only the array representation) after the deleteMin operation is performed on the following min-heap. 15 17 19 20 35 20 25 27 21 37 36 (c) Consider an initially empty max-heap, where the following keys are to be inserted one at a time: 11, 19, 23, 12, 13, 17, 13, 14, 18, and 33. Draw the tree that results after building this max-heap (d) Is it possible to find the maximum in a min-heap in O(log n) time? Justify. Problem #4i Consider the problem of inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, and 59 into a hash table of length 11 (TableSize 11) using open addressing with the standard hash function h(k) k mod TableSize. Illustrate the result of inserting these keys using: (a) Linear probing (b) Quadratic probing with quadratic probe function c(i) 3i2 + i. (c) Double hashing with u(k) - k and v(k)-1(k mod(Tablesize 1))