Distributed Hash Table $($DHT$)$ structured Peer$-$to$-$Peer $($P$2$P$)$ models

are employed in building content distribution networks for file sharing

with an aim to reduce the number of hops in answering a user query.

Considering a DHT structured P$2$P content distribution network, $(1)$

analyse the roles that a DHT structure plays in such a P$2$P network,

$(2)$ explain why such a P$2$P network like Chord scales well in terms of

the number of hops in answering a user query against the number of

peer nodes, $(3)$ explain why such a P$2$P network cannot afford to be

too dynamic in that peers might join or leave the network frequently.