1. Tree traversals. a. (4pts) Give the sequence of letters from an inorder traversal of this binary tree: q / \ e r / \ / \ c d n s \ / / \ a g t w Give the sequence of letters from these traversals of the tree below: b. (4 pts) a preorder traversal c. (4 pts) a postorder traversal q / | \ e f r / | /|\ | \ d n g h j s t 4 points 2. Use the stack-based algorithm for converting a postfix expression into an expression tree for the postfix expression: abc*+ghk+m*/* Illustrate each step. 4 points 3. Use your expression tree to find the expression in prefix notation.