Please answer part A and B of #2 and #3

2. 114 points) Heap Draw the binary min heap that results from inserting: 77, 22, 9,68, 16. 34, 13, 8 in that order into an initially empty binary min heap. You do not need to show the array representation of the a) eap. You are only required to show the final h heap, although if you draw intermediate heaps, please circle your final result