write a brief discussion (2-4 sentences) on each of these algorithms

1. Algorithm that sets last equal to the last element in a queue, leaving the queue unchanged WHILE (NOT IsEmpty(myQueue)) Dequeue(myQueue, last) Enqueue(newQueue, last) WHILE (NOT IsEmtpy(newQueue)) Dequeue(newQueue, item) Enqueue(myQueue, item) 2. Algorithm to create a copy of myQueue, leaving myQueue unchanged. WHILE (NOT IsEmpty(myQueue)) Dequeue(myQueue, last) Enqueue(newQueue, last) WHILE (NOT IsEmtpy(newQueue)) Dequeue(newQueue, item) Enqueue(myQueue, item) Enqueue(copyQueue, item) 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. Replace(myStack, first, second) Pop(myStack, item) WHILE (Item NOT equal first) Push(newStack, item) Pop(myStack, item) IF (NOT IsEmpty(myStak)) Push(newStack, second) WHILE (NOT IsEmtpy(newStack)) Pop(newStack, item) Push(myStack, item) 3. 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 Replace(myQueue, first, second) Dequeue(myQueue, item) WHILE (Item NOT equal first) Enqueue(newQueue, item) Dequeue(myQueue, item) IF (NOT IsEmpty(myQueue)) Enqueue(newQueue, second) WHILE (NOT IsEmtpy(newQueue)) Dequeue(newQueue, item) Enqueue(myQueue, item)