1. Write an algorithm that sets last equal to the last element in a queue, leaving the queue unchanged. 2. Write an algorithm to create a copy of myQueue, leaving myQueue unchanged. 3. Write an algorithm Replace that takes a stack and two items. If the first item is in the stack, replace it with the second item, leaving the rest of the stack unchanged. 4. Write an algorithm Replace that takes a queue and two items. If the first item is in the queue, replace it with the second item, leaving the rest of the queue unchanged