4. (basic) Consider a hash table of size m 1000 and a corresponding hash function h(k)- ash ta [m (kA-LkADJ for A = ( 5-1)/2. Compute the locations to which the keys 61, 62, 63, 64, and 65 are mapped