1,5,8,4,2,3,6,7,9 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 from the above input order. Write down the inorder, preorder, and post-order traversal of the tree you made