Use separate chaining to store the following keys. Consider that each letter is a number corresponding to the sequence of English alphabets. That is, A->1, B->2, ..., Z->26. Also consider that the size of the table is 8.
1. Consider that the size of the hashtable is M=16. Apply quadratic probing with f(i)=i2 for the following keys. Convert each of the keys to a number associated with the sequence of English alphabet and then draw a table that indicates successful and unsuccessful probing attempts. (The reader must be able to count the number of collisions before a letter is stored in a cell.)
OPENADDRESSING