6. (6 Points) The following figure shows a binary tree is used as an expression tree, where leaf nodes represents operands and non-leaf nodes represents binary operators. Provide the prefix expression (using pre-order traversal), infix expression (using in-order traversal), and postfix expression (using post-order traversal) corresponding to the tree below. lo