3. Draw the binary heap in its tree form from its array form: 0 1 2 3 4 5 6 7 8 9 10 12 23 4910 1715 11 9 13 22 20 4. Starting with an empty binary heap, insert the following sequence of elements into it: 1, 5, 2, 3, 7, 8, 1. Your answer should show the resulting binary heap after each insertion. However, there is no need to show the intermediate trees within an insertion step. 5. Build a heap for the following set of elements using the BuildHeap() method: (10,5,2,3,7,8,4,9,1}. You can populate the initial heap for the BuildHeap) function in any order of elements you want. But make sure you show the heap at different steps of the BuildHeap function, starting from your initial heap to your final binary heap. 6. Show the resulting binary heap after performing DeleteMin: DeleteMin0 10 9 16 11) (20)(30) (12) (15) (14