about postorder traversal of hr- show that the sum which appears in the analysis of heap-sortis ohm(nlognr- bill claims that preorder traversal of heap will list its keys in nonde creasing order draw an example of heap that proves him wrong - hillary claims that postorder traversal of heap will list its keys in non increasing order draw an example of heap that proves her wrong - show all the steps of the algorithm for removing key from the heap of figure - show all the steps of the algorithm for replacing key with in the heap of figure - 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 - 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 - give pseudo-code description of nonrecursive in-place heap-sort algorithm -