Q8.(14 points) Given a sequence of numbers: 11, 6, 8, 19, 4, 10, 5, 17, 43, 49, 31 a. Draw a binary search tree by inserting the above numbers from left to right. b. Give a preorder and postorder traversal of your binary search tree you created in part a. c. Show the tree you created above after deleting the root