sequence( , , , , , , , , , - illustrate the execution of the insertion-sort algorithm on the input se quence of the previous problem - give an example of worst-case sequence with elements for insertion sortand show that insertion-sort runs in ohm( time on such sequence - at which nodes of heap can an entry with the largest key be storedr- in defining the relation "to the left offor two nodes of binary tree (sec tion )can we use preorder traversal instead of an inorder traversalhow about postorder traversalr- illustrate the execution of the heap-sort algorithm on the following input sequence( , , , , , , , , , - let be complete binary tree such that node stores the entry ( ( ) )where (vis the level number of is tree heapwhy or why notr- explain why the case where node has right child but not left child was not considered in the description of down-heap bubbling - is there heap storing seven entries with distinct keys such that pre order 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-list representation of complete binary tree what is the sequence of indices of the array list that are