Consider a circular Distributed Hsh Table DHT with node identifiers in the range [0:30]. 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 6(i.e, object with key=6). What is the path taken? Suppose that peer 7 learns that peer 9 has left the DHT. How does peer 7 update its successor state information? Which peer is now it's first successor? it's second successor?