Use the array to construct a hash table representing the elements of the array. Use a hash function H(K) = K mod 5. Also, determine (using the hash table and a brute force search without hash table): (i) the average number of comparisons for a successful search (ii) the worst case number of comparisons for a successful search (iii) the worst case number of comparisons for an unsuccessful search. This is your array below [19,12,35,39,36,27,11,42,43,33,1,26,48,50,42]