In a hashed file organization, the division method is used to compute the hash address of a record. This method can be stated as follows:

Choose a large prime number m which is close to the number of keys n. Define the hash function h(k) = k (mod m) + c, where c is the lower limit of addresses.

If a set of records needs to be stored in 100 locations, starting from the address 7865, compute the address for the records having IDs 1234, 2345, 3333, and 4433.