10. Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q)– returns true if the queue is empty, false otherwise. ii....

Extracted text: 10. Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q)– returns true if the queue is empty, false otherwise. ii. delete (Q) – deletes the element at the front of the queue and returns its value. iii. insert (Q, i) – inserts the integer i at the rear of the queue. Consider the following function: void QUE(queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); QUE(Q); insert(Q, i); } } What operation is performed by the function QUE assuming the elements 1, 2, 3, 4 are in the queue ? %D Leaves the queue unchanged Empties the queue Q Reverse the order of the elements in queue Q Deletes the elements of the queue Q from the front and inserts it at the rear of the Queue Qkeeping the other elements in the same Ogen