Q5a) (Total: 6 marks). Consider a peer X that joins BitTorrent to download the pieces of a file F from a seeder as well as from its peers. However, peer X does not want to upload any of its own pieces (i.e., X is a free-rider!). Q5a(i) (2 marks). Explain why it is or it is not possible for peer X to download a complete set of pieces of file F. Q5a(ii) (2 marks). Explain why or why not peer X can download a complete set of pieces of file F faster if peer X uses multiple computers to download the pieces. Q5a(iii) (2 marks). Is it possible to prevent free-riders from P2P applications? Explain your answer. Q5b) (Total: 12 marks). Consider Kademlia m=4, eight nodes: N0, N1, N3, N5, N6, N8, N11, N15, five keys: k3,k4,k7,k9,k12, and bucket size k=1. The routing table for each node is given as follows. Q5b(i) (4 marks). Explain why Row 1 of N1 contains N5. Q5b(ii) (4 marks). Which key or keys from set (k3, k4, k7, k9, k12) is node N15 responsible for? Explain your answer. Q5a) (Total: 6 marks). Consider a peer X that joins BitTorrent to download the pieces of a file F from a seeder as well as from its peers. However, peer X does not want to upload any of its own pieces (i.e., X is a free-rider!). Q5a(i) (2 marks). Explain why it is or it is not possible for peer X to download a complete set of pieces of file F. Q5a(ii) (2 marks). Explain why or why not peer X can download a complete set of pieces of file F faster if peer X uses multiple computers to download the pieces. Q5a(iii) (2 marks). Is it possible to prevent free-riders from P2P applications? Explain your answer. Q5b) (Total: 12 marks). Consider Kademlia m=4, eight nodes: N0, N1, N3, N5, N6, N8, N11, N15, five keys: k3,k4,k7,k9,k12, and bucket size k=1. The routing table for each node is given as follows. Q5b(i) (4 marks). Explain why Row 1 of N1 contains N5. Q5b(ii) (4 marks). Which key or keys from set (k3, k4, k7, k9, k12) is node N15 responsible for? Explain your