b) For tree given above in part (a), write down the preorder, inorder and postorder traversals.

6 Question No. 5 (15 points) a) Show what will happen if the following operations are done one after another on the max heap given below. Once the tree changes after an operation, the next operation will be done on the changed tree. You must show the state of the tree after each step. Operations: DEQUEUE, ENQUEUE(45) 100 19 36 17 3 (25 1 2 7