Given the following:

26,5,77,1,61,11,59,15,48,19

Sort this by hand using Heapsort and answer the following questions:

(a) Draw the initial COMPLETE tree representation of the given BEFORE the HEAP is created.

(b) Draw the initial heap.

(c) Continue with the sort for two iterations PAST the initial heap i.e., you pop off 77 and 61 from the root. NOW RESTRUCTURE THE HEAP AFTER 61 is popped what is the NEW ROOT?