Consider a hashing technique that distributes 1200 records across 400 blocks (addresses). Assume a uniform distribution of the records across the blocks, and that 4 records can be stored at every block address without an overflow.
a. How many block addresses will be empty?
b. How many blocks will overflow?