A router implements a preemptive priority queueing policy, where high priority packets are served first, and their arrival interrupts low priority packets service. If the service is interrupted, the packet is dropped. The service time of packets is an exponential variable with rate =3 pkt/s. The input traffic to a router has interarrival time distributed according to an exponential distribution with rate 1=2 pkt/s (high priority) and 2=1 pkt/s. At time t=0, a packet (packet A) is being served by the router. Assume that only one more packet arrives in the routers buffer (packet B), that is, no more packets arrive after this packet. Note that packet A and B can be either high or low priority.

1) compute the probability that the service of packet A is interrupted.

2) compute the time from the arrival of packet B to the time it leaves the system.