Exercise 1 Using open addressing with linear probing, insert the following characters into an initially empty hash table of size 13: H, E, L1, L2,01, W, 02, R, L3, D Use the following procedure for indexing: . The function hashCode(c) maps character c to an integer such that hashCode(A)0 hashCode ('B')1, hashCode ('Z') 25 To determine the index of a key c (which is assumed to always be a character in 'A', B',. 'Z') within the hash table, compute hashCode(c) % table. size. Insert duplicate keys (typically duplicate keys are not inserted!), i e , consider the three 'L keys as different (but colliding) keys having the same hashode'L'). Also, treat the two O' keys as different keys which share the same hashCode'O')