draw heap that is also binary search tree analyse the complexity of heapify algorithm consider the fibonacci heap given below and then decrease the value of node to insert new node with value and finally delete node from it min[ reheap the following structure to make it heap multiple-choice questions show the array implementation of the following heap given the following array structuredraw the heap alsofind out (athe parent of nodes and and (bindex of left and right child of node which of the following sequences represents binary heap( ( ( heap sequence is given as which element will be deleted when the deletion algorithm is called thrice show the resulting heap when values and are added to the heap of the above question the height of binary heap with nodes is equal to (ao( (bo(log (co( log (do( an element at position in an array has its left child stored at position ( ( (ci/ (di/ in the worst casehow much time does it take to build binary heap of elements(ao( (bo(log (co( log (do( the height of binomial tree bi is ( ( (ci/ (di how many nodes does binomial tree of order have( ( ( ( the running time of link_binomial-tree(procedure is (ao( (bo(log (co( log (do( in fibonacci heaphow much time does it take to find the minimum node(ao( (bo(log (co( log (do(