Consider a circular Distributed Hash Table (DHT) Chord with node identifiers in the range [0; 31]. Suppose there are seven peers with identifiers 1, 4, 7, 9, 11, 13 and 15 are up running on the ring

 1) Provide the routing table for node 7

 2) Node 7 wants to access object with key = 6, what is the path taken ?

 3) Suppose that peer 7 learns that peer 9 has left the DHT. How does peer 7 updates its successor state information? Which peer is now its first successor? Its second successor?