Exercise1. As shown in Fig.1, the server and the peers are connected to the Internet with access links based on the client-server (CS) or peer-to-peer (P2P) architectures. We define as the distribution time (D), the time it takes to get a copy of the file to all N peers via the Internet core network. For both CS and P2P architectures, we assume that the Internet core has abundant bandwidth. Given the following networking characteristics: F=5 Gbits, file size us=60Mbps, server's upload capacity dmin=15Mbps, peer's download capacity ui=8Mbps, peer's upload capacity Figure 1: Networking parameters for file distribution (a) Calculate the minimum (lower bound) time needed for distributing a file using the CS and P2P architectures; see the formula and examples in the discussion slides. (b) Calculate and show graphically the minimum times for distributing the file using the CS and P2P architectures as a function of N peers, such that N=5,10,25,50,75,150,200 and 250 . In addition, briefly compare the two architectures based on the resulting graph. Finally, perform the above calculations and create new graphs for ui=2Mbps and ui=5Mbps. (note: you can show the plots for the 3uis and the client-server model in the same graph.)