4.01 a-3. Packet scheduling (3). Consider the pattern of red and green packet arrivals to a router's output port queue, shown below. Suppose each packet takes one time slot to be transmitted, and can only begin transmission (ot the earliest) at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers (att=1,2,3,4,5,6,7) under round-robin scheduling, with two classes of packets (red and green). Match each time unit (t1,t=2,t3) with the number of the packet that was transmitted and thus "departs" at that time unit. You can assume that if there are both red and green packets waiting for transmission following an idle slot (only) that the red will be transmitted first. At 11, theEinbsp, mumber of the packet that finishes transmission is: At t=2, theenbsp: number of the packet that finishes: transmission is \ : At t=3, the Bnbsp; number of the packet that finishes transmission is: Eunbsp: Al t4, thesenbsp; number of the packet that finishes transmission is:Enbspi At t=5, theEnbsp: number of the acket that finishes transmission is:enbsp: At t=6, the Snbsp; number of the packet that finishes transmission is:Enbsp: At t-7, the\&inbsp: number of the packet that finishes transmission is Entrsp