Assume the complete binary tree numbering scheme used by Heapsort and apply the Heapsort algorithm to the following key sequence (6,22,9,14,13,1,8). Answer the following questions: (a) What value is in the root node of the INITIAL STRUCTURE (NOT HEAP!)? (b) What value is in location 4 of the initial HEAP? (c) After a single deletion (of the parameter at the heap root) and tree restructuring, what value is in location 4 of the new HEAP?