1. 10 points In computability theory, it is well-known that a queue provides provably a finite-state machine without a stack). You wll demonstrate this at least partially by showing the following. (a) Demonstrate that a queue (FIFO) can simulate a stack (LIFO) by giving pseudocode for the basic push and pop operations in terms of a queue's enqueue and dequeue operations. (b) You (provably) cannot demonstrate the converse (that a single stack can simulate a queue). Instead, demonstrate that two stacks can simulate a queue by giving pseudocode for the basic enqueue and dequeue operations in terms of the two stacks push and pop operations