Suppose there is a linear chain of N links between a server and a client with each link having a packet loss probability p, and the packet losses for these links are independent. (1) What is the probability that a packet (sent by the server) is successfully received by the receiver? (2) If a packet is lost in the path along the links from the server to the client, then the server will re-transmit the packet until the client successfully receives it. On average, how many times will the server need to transmit the packet in order for the client to successfully receive the packet? You may want to review geometric distribution in the theory of probability to solve this problem (see https://en.wikipedia.org/wiki/Geometric_distribution).