a) (4 points) Draw a single binary tree T such that each of the following properties holds: each internal node of T stores a single character a preorder traversal of T yields COMPILE, and a inorder traversal of T yields PMIOLCE. (b) (6 points) Give an O(n)-time algorithm for computing the depth of each node of a tree T, where n is the number of nodes of T. Assume the existence of methods set Depth(v,d) and getDepth(v) that run in O(1)-time