$1.$ In a Weighted Fair Queue $($WFQ$)$ scheduling, let us assume there are $3$ queues: Q$1,$ Q$2$ and Q$3.$ Q$2$ weighs $3$ times $($x $3)$ while Q$3$ weighs $2$ times $($x $2).$ The notation for a packet Pxy means Packet x arrives at Queue y$.$ The table below shows the size of the packet $($in terms of processing units required$)$ and their arrival time.

Calculate their finishing time and rank them in order of their finishing times.

Arrival Time Required Time

P$11018$

P$211510$

P$312512$

P$121015$

P$221818$

P$322812$

P$1388$

P$231212$

P$331610$