A Queue has the following operations:

enqueue(x): Push elementx to the end of the Queue.

dequeue(): Remove the element from the front of the Queue

peek(): Get the front element

empty(): Return True if the Queue is empty, otherwise False

a.) What is the minimum number of stacks needed to implement the operations.

b.) Describe an algorithm for each of the four operations using stacks