TIIT lcqucslcssaye! 6. (3 points) Consider distributing a file of F= 20 GB to N peers. The server has an upload rate of Us = 1 Gbps, and each peer has a download rate of di = 20 Mbps and an upload rate of ui. For N = 10, N = 100, or N = 1000, and ui= 500 kbps, ui = 5 Mbps, or ui= 25 Mbps, prepare a table giving the minimum distribution time for each of the combinations of N and ui for both client- server distribution and P2P distribution. For simplicity, round your results for the minimum distribution time into integers in terms of seconds. TIIT lcqucslcssaye! 6. (3 points) Consider distributing a file of F= 20 GB to N peers. The server has an upload rate of Us = 1 Gbps, and each peer has a download rate of di = 20 Mbps and an upload rate of ui. For N = 10, N = 100, or N = 1000, and ui= 500 kbps, ui = 5 Mbps, or ui= 25 Mbps, prepare a table giving the minimum distribution time for each of the combinations of N and ui for both client- server distribution and P2P distribution. For simplicity, round your results for the minimum distribution time into integers in terms of seconds