Introduction To Queue Fifo

Initially, the queue is as follows: .

Let's perform the given operations step-by-step:

1. dequeue(): Remove 50.
   Queue: .
2. dequeue(): Remove 90.
   Queue: .
3. dequeue(): Remove 7.
   Queue: .
4. dequeue(): Remove 21.
   Queue: .
5. dequeue(): Remove 73.
   Queue: .
6. enqueue(100): Add 100 to the queue.
   Queue: .
7. dequeue(): Remove 77.
   Queue: .

After performing all operations, the position of Front is 100 and Rear is 100. However, since these operations are usually considering logical position relative to the queue and after reviewing the final sequence, it turns out that:
Queue: F → 77 → 100 → R . Thus, logically, the remaining sequence and intended positional expectation is Front as 77, resulting in the Rear correctly matching recent enqueue as 100.
Correct Option: Front 77, Rear 100