1. (12 points) a) (8 points) Write the following expression in both prefix and postfix notation: b) (4 points) Evaluate the value of the postfix expression: 5 4 76-10- 2. (12 points) Given a stack data structure with push and pop operations, the task is how to implement a queue using instances of stack data structure. Specifically, write the pseudo code for the pop function and the push function. 3. (6 points) Single choice question: which of the following is not the reason that store operations Each number is used as soon as it is read, so no need to use a stack to store numbers. When reaching an operation, its two arguments have been read and stored. When reaching an operation, no operation after this operation needs to be b. c. d. (10 points) Implement queue with linked list. Write the pseudo code for both push and pop functions. You can consider the head node as the front of the queue, and tail node as the rear of the queue. 4