Mark the following statements true or false.
1)Suppose that keys are t-bit binary integers. For a modularhash function with prime M greater than 2, it is always true thatif two keys differing only in one bit (such as 1111 and 1101) theywould have different hash values.
2)Consider the idea of implementing modular hashing for integerkeys with the code (a * k) % M, where a is an arbitrary fixedprime.This change mixes up the bits sufficiently well so nonprime Mcan be used.
Expert Answer
An answer will be send to you shortly. . . . .