Problem 3 Consider N file (i.e., size negligible) referencing a data file of F bits from a web server through the network shown in Fig. 1. Suppose the internal links have abun- dant bandwidth, and the edge links have bandwidth shown in the figure Ignore DNS query delays. users trying to download a web page containing a small HTML u,: server upload capacity d; user i download capacity file, size F bits server network with abundant bandwidth u, user i upload capacity Figure 1: Problem 3 illustration a) Suppose N 1 (only one user). The path from the user to the server has a round-trip delay of RTT seconds and a throughput of u, bps. How long does it take for the user to download the web page using non-persistent HTTP? 12 ptj How about using persistent HTTP? 12 pt] b) Consider a general N> 1. Give the minimum time from the beginning of downloading the data file to the completion of downloading at the last user, under: client-server architecture [2 pt] and P2P architecture [2 pt). c) Give the numerical answer for b) for F 100M bits, N 3, u, 2M bps, d d d 10M bps, u u2 IM bps, u 2M bps. 2 pt