answer the following Java questions:
1)Suppose you push the following numbers: 22, 24, 26, 28, 30, and 32 onto the stack, then you pop four items. List the numbers that are still in the stack.
2)Suppose you add the numbers: 22, 24, 26, 28, 30, and 32 onto the queue, then remove four items. List the numbers that are still in the queue.
3)Examine the following statement and explain which of the following is true:
a. The top of a stack is equivalent to the front of a queue.
b. In both the stack and the queue, items removed in sequence are the ones from
increasingly high index cells in the array.
4)Explain what LIFO and FIFO mean, and how they are used in Abstract data types?
5)Use examples to explain what Abstract data types (ADT) means, where ADTs are applied?
the differences between ADT and general purpose data structure.
6)Think about the events happens in your life, are these events stored in your brain like stack or sometimes a queue?
7) Describe the output of the stack after a series of operations: push(10), push(5), pop(), push(2), push(10), peek(), push(9), pop(), push(20), push(30), peek(), pop(), push(8).
8)Describe the output of the queue after a series of operations: add(10), add(5), remove(), add(2), peek(), add(20), remove(), add(15), peek(), remove().
