Consider a router that implements bit-by-bit fair queueing using three queues, viz. Queue A, Queue B, and Queue C, with Queue A and Queue B each having a packet of length L + 1 bits and Queue C having a packet of length L bits. The output link of the router is L bits/sec. The bit-by-bit fair queueing services the queues in a round robin manner by transmitting a bit from Queue A followed by transmitting a bit from Queue B, followed by transmitting a bit from Queue C, followed by again transmitting a bit from Queue A, and so on, until the queues become empty. Find the completion times of each of the three packets in the three queues.