Please ans these mcq asap. No explanation needed. Quick please

This question is about the Queueing simulation, Chapter 11.2. Match the variable name in the code with its purpose. service_queue nextArrival nextservice waiting This question is about the Bracket checking (matching) algorithm, Chapter 11.3. Match each purpose with the variable that serves that purpose in the code. a queue to contain brackets, but could also contain numbers and operators like +, etc a stack to contain only ( characters, but nothing else a flag to indicate that a ) was found before reaching the end of the expression Question 8 This question is about the Post-fix Arithmetic Evaluator, Chapter 11.4. Match the PF expression with the "normal expression" that gives the same answer ("normal" means the way we usually write it using brackets etc). 34+5 345+ 23+45+ Question 9 The Stack and Queue ADT implementations in Chapter 12 have a single attribute data which refers to a list. Which of the following statements is True? The front of the queue is necessarily the front (index 0 ) of the list. The top of the stack is necessarily the front (index 0 ) of the list. The top and bottom of the stack are BOTH necessarily at the end of the list. The front and back of the queve are necessarily at the opposite ends of the list. The top of the stack is necessarily the end (largest index) of the list. In the context of ADTs, an adapter is a program that: hides the details of an ADT's operations. enhances correctness through use of an ADT implements an ADT by using a different ADT. restricts the operations of an existing data type. defines an ADT in terms of a built-in data type