Due Date: Max Marks: 5 Q4: A program performs the following operations on an empty queue Q: Stacks: n. Q.enqueue(24) Q1: Please show how the following postfix expression can be evaluated using Stack as shown in o. Q.enqueue(74) the class. Please show the stack contents and the operations. p. Q.enqueue(34) q. Q.first () r. Q.dequeue() s. Q.enqueue(12) t. Q.dequeue() Please show the queue contents at the end of these operations. Clearly show the front and rear of Q2: A program performs the following operations on a stack S and Queue Q: the queue. a. S.push(52); b. S.push(52); c. S.push(S.peek()*2); Algorithm Analysis: d. System.out.println(S.size()); Q5: Please identify the time complexity of following code (using Big O notation). Assume that e. System.out.println(S.pop(0); f. S.pop(); g. System.out.println(S.size ()); h. Q.enqueue(36); i. Q.enqueue(28); j. Q.enqueue(Q.first 0%3 ); k. System.out.println(Q.first () ) eval method has a time complexity of O(n). Briefly explain why? 1. System.out.println(Q.dequeue()); m. System.out.println(S.pop()); The output from stack and Queue is: Q3: What are the benefits of implementing stack using a LinkedList rather than an array based int val =2n; for(int i=1;i