1->3->1->1->4->1->4->3->1->1->4->2->3->4. Who will be inthe front and back of the line respectively after the following code is executed? Assume that front is a pointer to the first node in the...

Extracted text: Consider the following circular FIFO queue that contains the numbers 3->1->3->1->1->4->1->4->3->1->1->4->2->3->4. Who will be in the front and back of the line respectively after the following code is executed? Assume that front is a pointer to the first node in the actual queue. front = enqueue (front, 1); enqueue (front, 3); front = enqueue (front, 3); front = dequeue (front); front = enqueue (front, 3); front = dequeue (front); front = dequeue (front); front = dequeue (front); front = enqueue (front, 4) front = dequeue (front); front = dequeue (front); front = enqueue (front, 1); enqueue (front, 4); front = enqueue (front, 4); front = dequeue (front); front = dequeue (front); front = dequeue (front); front = dequeue (front); front = dequeue (front); dequeue (front); front = dequeue (front); front = dequeue (front); front = dequeue (front); front = dequeue (front); front = dequeue (front); front = enqueue (front, 4); front = enqueue (front, 4); front front front