Q5) Heaps a) Insert the following items into an empty min heap one by one in the given order. 77, 68, 34, 16, 13, 8,15, 20,, 5 Show the resulting min heap as a complete binary tree: 1 Show the resulting min heap as an array: b) Consider the following min heap given as an array: 21 25 24 37 52 63 7 82 Apply two deleteMin ) operations on this heap. Show the array contents after cach deleteMin