Consider a 2 x 2 switch

Consider a 2 x 2 switch. Consider the following Maximal Scheduling algo— rithm: Whenever Q11 or Q22 are nonempty1 schedule these queues. If both Q11 and @225 are zero1 schedule Q12: Q91. Output! 021 :- Om :- Input 2 (i) [5 points) Consider the queues indicated in the ?gure and assume no further packets arrive- Write the sequence of matchings used by this algorithm to schedule the packets. output 2 (ii) {15 points]I Suppose packets arrive at the queues with arrival rates A12 2 A31 2 A2; = 0.2. Mat is the maximum arrival rate All that this scheduling algorithm can support such that all the queues remain stable?