Consider a circular DHT with node and key identifiers in the range [0,..,N-1], where N=64. Suppose there are 17 peers in the network with identifiers 0,4,7,11,18,23, 25,29,33,37,41,45,49,53,57,61,63. a. Suppose a file is stored in this circular DHT and it is mapped to a key of 40, which node will store the file? b. If each node stores only the id of 2 neighbors along the circle, trace the steps involved to find file with key = 40 from node 0. c. If each node stores log2(N), i.e., 6 entries in its finger table using the exponential separation discussed in class, what are the finger table entries for nodes 0 and 29? [Recall that a node with id x, stores in its finger table, entries corresponding to x+2r, where r ranges from 0 to log(N)-1, i.e., r = 0,1,2,3,4,5]. d. If 0 is looking for file with key of 40, using the logarithmic finger table, trace its steps.