1. In a circular Distributed Hash Table (DHT) with no shortcuts, 8 peers participate. These pe ers have the following integer identifiers. Assume that the closest ID with hash values to a peer for a database of 8192 records. algorithm is used in assigning records Peer # Identifier 2 440 1325 2150 4802 5432 6750 7320 4 6 a) In which peer a record with hash number 4012 is stored? How about hash number 8191? (1 pts.) If a user places a query on peer #4, asking for a record of hash number 441, what sequence of peers this query and its response would have to go through for the user to receive its response? (12 pts.) b) is the