BUILD-MAX-HEAP(A) and C. HEAP-INCREASE-KEY(A, i, key

2. Consider the integer array A- [20, 2,10, 7,18,8,9,5,4, 12,1,7] A. Give the complete binary tree representation for the array A B. You can see that A is not a max heap. Use the pseudo code BUILD-MAX-HEAP(A) (textbook pp. 157) to draw the intermediate complete binary trees until you get a max heap (see pp.158 Figure 6.3 as an example). C. HEAP-INCREASE-KEY(A, i, key) is an operation used in priority queues and we discussed it in class. Given the max-heap you get in above step B, show the operations of HEAP-INCREASE- KEY(A, 10, 19) by drawing the intermedia binary tree step-by-step (see pp.165 Figure 6.5 as one example)