Suppose you are stranded on a desert island on which queues are plentiful, but no other data structures (arrays, lists, sets, maps, etc.) exist. You need a stack. How can you implement a stack using two queues? Describe each of the stack operations (isEmpty, push, pop, and peek) in terms of the queue operations (isEmpty, enqueue, dequeue, and peek). Your answer can be in the form of algorithms or Java methods.