$($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 Listing

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 Queuing, with flow $2$ having weight

$4,$ flow $3$ having weight $2$ and flow $4$ having weight $1.$

$[10$ Marks$]$