Question 3: (20 points) (Inorder and Preorder Sequences for a binary tree) (a) (12 points) Given inorder traversal sequence = DGBEAFHC and Preorder traversal sequence = ABDGECFH, obtain the unique binary tree. Explain your algorithm. (b) ( 8 points) Use the ideas from a) to develop an algorithm to find a unique tree when an inorder and preorder sequence for a binary tree is given..