The natural sequence for serving $3$ classes $(1,2,$ and $3)$ at a router buffer is: $123123123...$

if round robin scheduling is used. Now, let$$s assume Weighted Fair Queuing $($WFQ$)$

scheduling policy is applied. The weights are $0\mathrm{.}6,0\mathrm{.}3,$ and $0\mathrm{.}1$ for classes $1,2,$ and $3,$

respectively. Answer the following.

a$.$ Suppose that each class has a large number of packets in the buffer. In what sequence

might the three classes be served in order to achieve the WFQ weights? Show the

sequence for first $25$ served packets