QUESTION 2 [8] Q2(a) Is the array with values (23, 17, 14, 6, 13, 10, 1, 5, 7, 12) a max-heap? Justify (b) Write an array representation of the following binary tree U S (C) Approximately how many comparisons would be made by binary search when searching a list of one million elements in the best, worst, and average cases? [5] (d) The integers given below are to be inserted in a hash table with 8 locations to resolve collisions. 36, 18, 72, 43, 6, 10,5, 15 Construct hash table using hash function "key % tablesize' in following approaches (0) Open addressing [5] Linear probing [5] [Total 25 Marks]