Q1. Consider a slotted ALOHA type network in which each node attempts to transmit a frame in each slot with probability p. It is assumed here that each node always has a frame to send and that the node transmits with probability p for a fresh frame as well as for a frame that has already suffered a collision. Suppose there are N nodes. Then the probability that a given slot is a successful slot is the probability that one of the nodes transmits and that the remaining N-1 nodes do not transmit. The probability thata given node transmits is p, the probability that the remaining nodes do not transmit is (1 - p)N1. Therefore the probability a given node has a success is p(1 -p)N1. Because there are N nodes, the probability that any one of the N nodes has a success is Np(1 -p) This is also the efficiency of this slotted ALOHA protocol Given that there are N participants, determine p that maximizes this efficiency.Also determine the maximum efficiency for the li mit N approaching infinity