Let A and B be two stations attempting to transmit on an Ethernet. Each has a steady queue of frames ready to send; A’s frames will be numbered 1, 2 and so on, and B’s similarly. Let T = 51.2 c be the exponential backoff base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times of 0 × T and 1 × T, respectively. As a result, Station A transmits 1 while Station B waits. At the end of this transmission, B will attempt to retransmit 1 while A will attempt to transmit 2. These first attempts will collide, but now A backs off for either 0 × T or 1 × T (with equal probability), while B backs off for time equal to one of 0 × T, 1 × T, 2 × T and 3× T (with equal probability).(a) Give the probability that A wins this second backoff race immediately after his first collision.(b) Suppose A wins this second backoff race. A transmits 2 and when it is finished, A and B collide again as A tries to transmit 3 and B tries once more to transmit 1. Give the probability that Awins this third backoff race immediately after the first collision.(c) What is the probability that A wins all the backoff races. ( is a given constant)(d) Assume that there are 3 stations sharing the Ethernet. Will the chance for A to win all the backoffraces decrease or increase? Why?