*** Please show me how you got the answer, step by step I dont understand, I need to know for a test!

1. In a circular Distributed Hash Table (DHT) data base, 8 peers participate. These peers have the following integer identifiers. Assume that the closest algorithm is used in assigning records with hash values to a peer for a database of 5000 records.

Peer #	Identifier
1	118
2	367
3	884
4	1324
5	2124
6	2843
7	3456
8	4290

a) In which peer a record with hash number 4012 is stored? How about hash number 2001? (8 pts.)

b) If a user places a query on peer #6, asking for a record of hash number 422, what is the sequence of peers this query and its response would have to go thru for the user to receive its response? (8 pts.)