A min-heap with 10 elements is given in the following array format. The following three sub-questions all refer to this max heap.

i	1	2	3	4	5	6	7	8	9	10
A[i]	11	22	33	44	55	66	77	88	99	100

Show the result after applying heap-increase-key(A, 6, 12) to the max-heap at the top of this page:

i	1	2	3	4	5	6	7	8	9	10
A[i]

Show the result after applying heap-extract-min(A) to the max-heap at the top of this page:

i	1	2	3	4	5	6	7	8	9	10
A[i]

Show the result after applying min-heap-insert(A, 20) to the max-heap at the top of this page:

i	1	2	3	4	5	6	7	8	9	10
A[i]

The answer needs to be filled out in the tables