6. A Queue Automaton (QA) is like a Pushdown Automaton except it has a Queue instead of a Stack. A Queue is like a Stack except values are added to the end of the queue and removed from the front. (This is called FIFO - first in first out.) Adding a value to the end is called a push and removing from the front is called a pull. The Queue Automaton works similarly to a PDA, except at each move the automaton will check the state, input, front of the queue, and back of the queue. The automaton will then move to a state and can perform a pull operation from the front of the queue (like a PDA pop) and/or a push operation to the back of the queue. Show that a QA is more powerful than a PDA by giving a QA in table format to recognize L = {a"B"c" n > 0) which is not a CFL