Assume a distributed database in a p2p network implemented through a circular Distributed Hash Table (DHT) with 8 users. Suppose that each user identifier is a number in the range [0,2^(4)-1]. Now suppose that the database contains entries of the type (filename,IP address) where the filename is an integer number between 0 and 49999.

1. Give an example of simple hash function that can be used to design such a distributed database.

2. Suppose that the peers in the distributed database have the following identifiers: 2, 5, 6, 8, 10, 12, 13, 15. Peer 13 wants to find the IP address of the peer from where to download the file with filename = 697. Describe the steps that will be taken by the peers according to your proposed hash function.