- consider situation in which user has numeric keys and wishes to have priority queue that is maximum-oriented how could standard (minorientedpriority queue be used for such purposer- illustrate the execution of the in-place heap-sort algorithm on the following input sequence( - let be complete binary tree such that position stores an element with key ( )where (pis the level number of (see section is tree heapwhy or why notr- explain why the description of down-heap bubbling does not consider the case in which position has right child but not left child - is there heap storing seven entries with distinct keys such that preorder traversal of yields the entries of in increasing or decreasing order by keyhow about an inorder traversalhow about postorder traversalif sogive an exampleif notsay why - let be heap storing entries using the array-based representation of complete binary tree what is the sequence of indices of the array that are visited in preorder traversal of hwhat about an inorder traversal of hwhat about postorder traversal of hr- show that the sum log ii= which appears in the analysis of heap-sortis ( log nr- bill claims that preorder traversal of heap will list its keys in nondecreasing order draw an example of heap that proves him wrong - hillary claims that postorder traversal of heap will list its keys in nonincreasing order draw an example of heap that proves her wrong - show all the steps of the algorithm for removing the entry ( from the heap of figure assuming the entry had been identified with locator - show all the steps of the algorithm for replacing key of entry ( awith in the heap of figure assuming the entry had been identified with locator - draw an example of heap whose keys are all the odd numbers from to (with no repeats)such that the insertion of an entry with key would cause up-heap bubbling to proceed all the way up to child of the root (replacing that child' key with - describe sequence of insertions in heap that requires ( log ntime to process - complete figure by showing all the steps of the in-place heap-sort algorithm show both the array and the associated heap at the end of each step