4. a) For the original tree given above in Question 3(a), write down the preorder, inorder and postorder traversals.

## Please Answer 4(a); ignore 3(a)##

Thank you

Question No. 3 a) Show what will happen if the following operations are done one after 6 another on the min 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: ENQUEUE(7), ENQUEUE(13), (, DEQUEUEO 10 14 19 26 31 42 27 44 35 33