A stack and queue can be viewed as a special type of list. Using a stack the elements are accessed, inserted, and deleted only from the top of the stack. Whereas, using a queue the elements are inserted into the end (tail) of the queue, and are accessed and deleted from the beginning (head) of the queue. What is the output of the program below that implementing stack and queue (based on this definition)? (6 marks) public class TestStackQueue { public static void main(String[] args) { GenericStack stack = new GenericStack (); stack.push("Hakim"); stack.push("Akim"); stack.push("Aqim"); stack.push("Muhammad"); stack.push("Mohammad"); stack.push("Mohd"); stack.push("Muhd"); System.out.println (stack.pop()); System.out.println(stack.pop()); System.out.println("STACK: " + stack); GenericQueue queue = new GenericQueue (); queue.enqueue ("Hakim"); queue.enqueue ("Akim"); queue.enqueue ("Aqim"); queue.enqueue ("Muhammad"); queue.enqueue ("Mohammad"); queue. enqueue ("Mohd"); queue.enqueue ("Muhd"); System.out.println (queue. dequeue ()); System.out.println (queue.dequeue ()); System.out.println("QUEUE: " + queue); }//end main }//end class