- In a double hashing scheme, - the initial hash function is H(k)=kmod10, where k is the numerical key. - If needed, subsequent hash functions are Hi(k)(H(k)+iG(k))mod10, where G(k) =7 - (kmod7) and i increases from 1 by steps of 1 until no further collision occurs. a. Please fill Table 1 to trace the insertion of the following six keys: 89, 18, 49, 58, 69 . b. Write program to implement this double hashing scheme. Please refer to hashquadh/ /c \& testhashc in Code-c2e_all_ch on ittp