Please help with this problem and please show steps

(10 pts) In lecture, we studied max-heap and its operations in detail. The min-heap data structure is defined similarly, with max replaced by min, greater than replaced by less than, etc. The operations of min-heap are also symmetric to the corresponding operations of max-heap. This question is about min-heap. A min-heap with 10 elements is given in the following array format. The following sub-questions all refer to this mn heap (not the heap you obtained after doing some operations) i123 45 6 789 10 AU 10 | 20 | 30 | 40 | 50 | 60 | 70 | 80 | 90 | 99 Show the result after applying heap-decrease-key (A, heap at the top of this page. a. 9, 15) to the min- i123 45 67 8 10 ALE b. Show the result after applying heap-extract-min(A) to the min-heap at the top of this page i1234567 8 10 ALA Show the result after applying min-heap-insert (A, the top of this page c. 30) to the min-heap at 12345 67 8 910 11 AL