(15 points) A max-heap with capacity 20 and size 10 is shown in the following array format. The following three sub-questions all refer to this max-heap (not the heap you obtained after doing some operations). (a) On the answer sheet, show the result after applying heap-extract-max (A) to the maxheap at the start of this question. (b) On the answer sheet, show the result after applying heap-increase-key (A, 10, 49) to the max-heap at the start of this question. (c) On the answer sheet, show the result after applying max-heap-insert (A, 48) to the max-heap at the start of this question. Q1: Read the instructions for question Q1 in the assignment document. For each of the three sub-questions, write your answer to the question in the given space. (a): After the extract-max operation, we have A[1]= A[2]= A[3]= A[5]= A[10]= (b): After the increase-key operation, we have A[1]= A[2]= A.[3]= A[5]= A[10]= After the insertion operation, we have