[25 points] Question1 (Stack ADT) a. [5 points] Given a stack ADT, write the proper sequence of the two operations; push and pop; that gives the output B, D, E, C, A in sequence if the values A, B, C, D and E are only pushed in order, while they can popped at any time. b. [5 points] Convert the following infix expression to postfix using the stack ADT. Show the status of the stack after each step. Infix Expression: ((*)/d)-c*b/a Postfix Expression: c. [10 points] Given the StackInterface and the LinkedStack class, with operations; push(), pop(), and is Empty(), write the StackSort method that takes a stack; Stackl; of integer elements, and returns another stack; Stack2; of the same elements sorted in a descending order. Hint: Only stacks are allowed to be used. d. [5 points] What is the worst case time complexity to push an element into a stack ADT implemented using an array? [25 points] Question1 (Stack ADT) a. [5 points] Given a stack ADT, write the proper sequence of the two operations; push and pop; that gives the output B, D, E, C, A in sequence if the values A, B, C, D and E are only pushed in order, while they can popped at any time. b. [5 points] Convert the following infix expression to postfix using the stack ADT. Show the status of the stack after each step. Infix Expression: ((*)/d)-c*b/a Postfix Expression: c. [10 points] Given the StackInterface and the LinkedStack class, with operations; push(), pop(), and is Empty(), write the StackSort method that takes a stack; Stackl; of integer elements, and returns another stack; Stack2; of the same elements sorted in a descending order. Hint: Only stacks are allowed to be used. d. [5 points] What is the worst case time complexity to push an element into a stack ADT implemented using an array