Q2(a) Is the array with values (3,9,4,28,11,18,20,35.46,12,15) a min-heap/max-heap? Justify [6] (b) Write an array representation of the following binary tree (41 (C) Approximately how many comparisons would be made by binary search when searching a list of 50k 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,50, 76, 39, 100, 1, 65,22 Construct hash table using hash function "key % tablesize in following approaches (0) Open addressing [5) Linear probing [5]