Que1 (a) In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system: 1, 12, 123, 234, 345, 456, 501.

What node id is the file with id 120 stored at (assuming only one replica)?

(b) In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system: 1, 12, 123, 234, 345, 456, 501. Which of the following nodes is not present as a finger table entry or successor of 234?

(i)1

(ii)501

(iii)345

(iv)456

(c) In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system: 45, 32, 132, 234, 99, 199. What is the comma-separated list of 8 finger table entries at node 45?

Use the text box below to enter your answer as a sequence of numeric values with each numeric value separated by a comma. Please ensure you enter one number for each finger table id i (you do not need to enter i, but only the node id's).

(d) In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system: 1, 12, 123, 234, 345, 456, 501. If node 234 fails, which of the following nodes will not update any of their finger table entries or successors?

(i)12

(ii)123

(iii)456

(iv)501

(e) In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system: 45, 32, 132, 234, 99, 199. If node 45 fails, then what is the comma-separated list of all the nodes whose finger tables need to be updated?

Use the text box below to enter your answer as a sequence of numeric values with each numeric value separated by a comma. Please ensure you list nodes in increasing order of id.