Consider the following stream of pockets: Packets #1 and #2 arrive at t-o. a3 and 4 arrive at t-1 #5 arrives at 1-2 etc. Each packet takes exactly one time slot to process. Only one packet can be processed at any time. Assume packet #1 leaves the queue at tal. All time slots are equal length. Arrivls to23710 Departures to 1 345 7 8910 a. First assume a FIFO (Firss-in, First-out) service. Indicate the time skots in which packess 2 through 12 each kave the queue. Calculate the average queuing delay for a packet in this scenario b. Now assume a pricrity service, with packets 1. 4, 5. 6, and 11 being high-priority packets. The remaining packets are low priority. Indicate the time slots in which packets 2 throagh 12 each eave the queue. Calculate the average queuing delay for a high-priority packet and a low-priority packet in this scenario. Also, calculate the overall average queuing delay (for all packets). c. Now suppase that round robin service is used, with packets 1, 4, 5. 6, and 11 belonging to one class of traffic, and the remaining packets belonging to the second class of traffic. The sysiem would process the first packet from class 1, then a packet from class 2, then again from class 1 and so on. Indicate the time slots in which packets 2 through 12 each leave the quewe. Calcalate the average queuing delay for a packet in each class of service. Also, calculate the overall average queuing delay (for all packets)