Consider a Chord overlay network with 64 keys identified by 6-bit key identifiers. Assume six nodes (0, 4, 7, 12, 32, 50) are populated at present. The rest are not assigned yet. Answer the following questions using this Chord graph: a. What are the data keys and node keys stored in node 0? b. Work out the finger table for node 7. Describe how node 7 uses the finger table to find the shortest routing path to reach the home node of a document file where data key 3 is located. c. Describe how to insert a new node 45 into this Chord structure. You need to show the shortest path on the Chord graph leading to the node holding key 45. d. Use the finger table at the predecessor node to perform five lookup operations to establish the finger table for this new node 45.