(c) Assume a router uses 4 buffers to store different traffic flows. It receives the packets listed in Table 1 at about the same time, in the order listed. All buffers are initially empty and transmission is not possible until all packets are received. Give the order Table 1: Packet, Size and Flow. Packet Size Flow 480 480 | 720 2 640 voor A CON AC CONNA 400 400 320 in which packets are transmitted assuming that buffer 1 is a Priority Queue and that buffers 2, 3 and 4 are scheduled using Weighted Fair Queueing with flow 2 having weight 4, flow 3 having weight 2 and flow 4 having weight 1