Amachine word stores a w-bit string in {0, 1} w. we will construct a hash function ha, b : {0, 1} w → {0, 1} by picking an a ∈ {0, 1} w uniformly at random and a b ∈ {0, 1} uniformly at random. consider the following three ways to evaluate ha, b(x)