(a) Draw a binary tree with 10 nodes labeled 0,1,...,9 in such a way that the inorder and preorder traversals of the tree yield the following lists: 1,3,9,8, 2,5, 0,7,4,6 (Preorder) and 3, 9, 2,8,5,1,7,4,6,0 (Inorder) inorder and preorder traversal lists of the same binary tree 0,1,n -1 are generated by the inorder and preorder traversals of the tree. Your (b) Give an example of two permutations of the same n labels 0,1,...,n -1 that cannot be (c) Design an algorithm that constructs a binary tree for which two given lists of n labels algorithm should also indentify inputs for which the problem has no solution