(a) Draw a binary search tree with 10 nodes labeled 0, 1,..., 9 in such a way that the inorder and postorder traversals of the tree yield the following lists: 0,1, 2, 3, 4, 5, 6, 7, 8, 9 (inorder) and 0, 1, 3, 2, 6,5,9, 8, 7, 4 (postorder). (b) What order were the values inserted into the binary search tree