Suppose a router’s drop policy is to drop the highest-cost packet whenever queues are full, where it defines the “cost” of a packet to be the product of its size by the time remaining that it will spend in the queue.Note that in calculating cost, it is equivalent to use the sum of the sizes of the earlier packets in lieu of remaining time.

(a) What advantages and disadvantages might such a policy offer compared to tail drop?

(b) Give an example of a sequence of queued packets for which dropping the highest-cost packet differs from dropping the largest packet.

(c) Give an example where two packets exchange their relative cost ranks as time progresses.