1. Evaluate the following postfix expressions: a. 45 + 3 * 7 - b. 6 2 +5* 84/- 2. Evaluate the following Postfix Expressions: a. 45 7 2 + . * b. 57 +62-* 3. Enumerate the steps of the algorithm of Inorder Traversal. Algorithm Until all nodes are traversed: STEP 1: STEP 2: STEP 3: 4. Construct the universal address system for the given ordered rooted tree. 5. Using the expression ((x +2) 1 3) * (y +(3+x)) - 5 a. Represent the expression using binary tree b. Write the expression in prefix notation. c. Write the expression in postfix notation. d. Write the expression in infix notation