if we using the alphabet {a,b,c,...,z} where a = 0, b = 1, etc., using a modulus of 23.

hash value = (26³ (b) + 26² (a) + 26(r) + h) mod 23) = 16.

Find an 8 character string starting with abc which leads to the maximum number of false hits when searching for the "barh"

hint ( abc - - - - - )

1) ((26³ (a) + 26² (b) + 26(c) + ?)) mod 23 = 16 how can I find '?'