Q.1 Build a Binary Search Tree with the given input order. You must show step by step process of inserting the inputs including both recursive calls and tree diagrams for each step. You must use the assigned input order. Q.2 Write down the inorder, preorder, and post-order traversal of the tree you made in Question 1. 3 marks

Q.3 Delete the Left Node of level 1 from the tree you have built-in Question 1. Show step-by-step procedure of deleting and draw the final status of the tree after deletion is completed. Now, you have a new tree that is different from the previous tree. Delete the Right Node of level 1 from this derived tree. Show step-by-step procedure of deleting and draw the final status of the tree after deletion is completed.

Given - 4,9,1,5,2,8,3,6,7