$4\mathrm{.}01.$b$-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 at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers $($at t$=1,2,3,4,5,6,7)$ under round$-$robin scheduling, with two classes of packets $($red and green$).$ Match each time unit $....)$ with the number of the packet that was transmitted and thus "departs" at that time unit. $[$Note: You can find more examples of problems similar to this here e$..]$ At t$=1,$ the number of the packet that finishes transmission is: At t$=2,$ the number of the packet that finishes transmission is: At t$=3,$ the number of the packet that finishes transmission is: $[$ Choose $][$ Choose $]$ packet $6$ packet $3$ packet $1$ packet $4$ packet $5$ packet $7$ packet $2$ At t$=4,$ the number of the packet that finishes transmission is: At t$=5,$ the number of the packet that finishes transmission is: At t$=6,$ the number of the packet that finishes transmission is: At t$=7,$ the number of the packet that finishes transmission is: