2. Consider two parallel communications links from node A to node B. One link is fast so that each data packet over this link needs one timeslots to be transmitted. The other link is slow so that each data packet over this link needs two timeslots to be transmitted. Let An be the number of packets that arrive at node A during timeslot n. Assume that {An : n = 1,2, ..., } is an iid sequence with distribution given in (1) To make the counting of packets easier, assume the following sequence of events in each timeslot: packets arrive during the timeslot (waiting in a common buffer of infinite size if necessary ), packets in transmission leave the system at the end of this timeslot if they reach the destination, a new packet starts transmission over a link at the beginning of next timeslot (equal to the end of current timeslot) if the link is free and there is a packet in the buffer to transmit. When both links are free and there is