. (20%) Answer the following questions about max and min heaps. (a) Finding the largest(smallest) element is easy on a max-heap(min-heap). What about finding the smallest(largest) element on a max-heap(min-heap)? Design an algorithm to find the smallest(largest) element on a max-heap(min-heap) which does not need to scan through all elements of the heap. (Note: No need to write C++ code here. Just the algorithm.) (b) Draw the max-heaps (initially empty) after each insertion of elements 12, 24, 20, 6, 27, 10, 16, 41, 30 in that order. c) Draw the max-heaps after each of three delete operations. d) Draw the min-heaps (initially empty) after each insertion of the elements in (b) in reverse order, i.e. 30, 41, 16, 10, 27, 6, 20, 24,12. ) Draw the min-heaps after each of three delete operations