without searching the entire heapunless it happens to be equal or greater to the largest value and you have largest on top heap likewiseif you have smallest on top heap and are looking for valueyou would have to look at all values unless the value you are searching for is equal or smaller than the smallest value commonlyheaps are used to implement priority queues where the elements of queue are ordered according to some kind of priority value an element can be added to an existing heap in (log ntime an element can be removed from heap in (log ntime as well this makes heap the logical choice for priority queue implementation priority queues are useful in message passing frameworks and especially in some graph algorithms and heuristic search algorithms review questions answer these short answermultiple choiceand true/false questions to test your mastery of the state the heap property for largest on top heap when removing value from heapwhich value are you likely to removewhy after removing value from heapwhat steps do you have to take to ensure you still have heap if you had heap of height what would be the total maximum travel distance for all nodes in the heap as you built it using version phase of the heapsort algorithm use __siftupfrom(from version of the heapsort algorithmadding new element to growing heap on each pass to construct largest-on-top heap from the following integers sketch new picture of the binary heap each time the structure changes use __siftdownfromto(from version of the heapsort algorithm on the same data as in the previous problemsketching new picture of the binary tree each time the structure changes using the final heap from problem execute phase ii version of the heapsort algorithmusing __siftdownfromto to sort the data in increasing order sketch new picture of the binary tree each time the structure changes redo problems and this time showing the data in arrays ( listswith starting index rather than drawing the tree structures show the new values of the structure after each pass use the following data why does heapsort operate less efficiently than quicksort when is heap commonly usedthis copy belongs to 'acha