Consider a distributed hash table implemented via the Chord system with m = 4. The finger tables are as follows: m: 4 Node 15 Node 3 1 2 3 4 1 2 3 3 3 8 5 5 8 15 4 Node 10 Node 8 Node 5 1 15 15 N 1 2 3 4 10 10 15 3 1 2 3 4 8 8 10 15 15 4 3 What sequence of nodes are visited when using the finger tables correctly for the following lookup: lookup key 7 starting at node 15: 1 Aw 15 3 3 4 15 3 II 10 15 What sequence of nodes are visited when using the finger tables correctly for the following lookup: lookup key 7 starting at node 15: 8 none of these 15 - 3 - 10 15 - 8-3 - 15 15-3-5-8