Question 3 [6 points] Answer the following questions regarding DHTS. (A) [2 points] If two peers share a link in the overlay (they are neighbors in the overlay network represented as a graph), can they necessarily exchange information with low latency (actual real time, not hops)? In at most 3 sentences, explain why or why not. (B) (2 points) Assume n nodes in the Chord DHT. What is the size of the routing table (or finger table that each node holds? And, how many messages must be sent in the worst case to locate a data item in the DHT? Report your answers as a function of n and use big-O notation. (C) (2 points) Tell me an application that uses a DHT as part of its implementation (does not need to be the Chord DHT). Go ahead and use google (wikipedia may be useful here); remember to cite your sources. Question 3 [6 points] Answer the following questions regarding DHTS. (A) [2 points] If two peers share a link in the overlay (they are neighbors in the overlay network represented as a graph), can they necessarily exchange information with low latency (actual real time, not hops)? In at most 3 sentences, explain why or why not. (B) (2 points) Assume n nodes in the Chord DHT. What is the size of the routing table (or finger table that each node holds? And, how many messages must be sent in the worst case to locate a data item in the DHT? Report your answers as a function of n and use big-O notation. (C) (2 points) Tell me an application that uses a DHT as part of its implementation (does not need to be the Chord DHT). Go ahead and use google (wikipedia may be useful here); remember to cite your sources