(a) Draw a binary 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: 7, 8, 5, 2,9,0,3,1,4,6 (inorder) and 7,5, 2, 9,0,8,4, 1,6, 3 (postorder). (b) Give an example of two permutations of the same n labels 0,1,...,n- 1 that cannot be inorder and postorder traversal lists of the same binary tree. (c) Design an algorithm that constructs a binary tree for which two given lists of n labels 0,1,...,n - 1 are generated by the inorder and postorder traversals of the tree. Your algorithm should also indentify inputs for which the problem has no solution