space for instance variables in addition to an input array itself - assuming the input to the sorting problem is given in an array adescribe how to implement the insertion-sort algorithm using only the array andat mostsix additional (base-typevariables - describe how to implement the heap-sort algorithm usingat mostsix integer variables in addition to an input array itself - describe sequence of insertions in heap that requires ohm(nlogntime to process - an alternative method for finding the last node during an insertion in heap is to storein the last node and each external node of ta reference to the external node immediately to its right (wrapping to the first node in the next lower level for the right-most external nodeshow how to maintain such references in ( time per operation of the priority queue adt assuming is implemented as linked structure - describe an implementation of complete binary tree by means of linked structure and reference to the last node in particularshow how to update the reference to the last node after operations add and remove in (logntimewhere is the current number of nodes of be sure and handle all possible casesas illustrated in figure figure updating the last node in complete binary tree after operation add or remove node is the last node before operation add or after operation remove node is the last node after operation add or before operation remove