Q.1. (10) We have to implement a hash table by initialize a character array of length 15 to store the keys in
it. Show the contents of array when the keys are “characters of your full name” inserted into an
empty hash table with double hashing to resolve collision in it. Take initial 10 letters of your name.
If you have letters less than 10 add X at the end. Use h (k) = k mod 26 and h’ (k) = k mod 10 as
the hash function for the kth letter of the alphabet. (Note: A = 1st letter of alphabet, B= 2nd letter
of alphabet ……. Z = 26th letter of the alphabet).
For e. g. name is “DUR E SHAWAR AGHA”
Keys = D U R E S H A W A R (initial 10 letters)
Keys = 4 21 18 5 19 8 1 23 1 18
Screenshots also required of output