Given a sequence of 5 element keys < 23, 26, 16, 38, 27 > for searching task: a) Given the hash function H(k) = (3.k) mod 11, insert the keys above according to its original sequence (from left to right) into a hash table of 11 slots. Indicate the cases of collision if any. b) In case of any collisions found above in a) part, determine the new slot for each collided case using Linear Probing to solve the collision problem. Clearly show your answer for each identified case. No step of calculation required. (Answer with “NO collision found”, in case there is no collisions found above) c) In case of any collisions found above in a) part, determine the new slot for each collided case using Double-Hashing (with functions below) to solve the collision problem. Show your steps and calculations with a table as in our course material. d1 = H(k) = (3.k) mod 11 di = (di−1 + ((5·k) mod 10) + 1) mod 11 , i ≥ 2 (Answer with “NO collision found”, in case there is no collisions found above) ​​​​​​​d) Suppose the given sequence < 23, 26, 16, 38, 27 > is stored in linear structure of an array (stored from left, as the beginning of the array) for simple sequential searching, find the average search length (ASL) if they have probabilities < 0.1, 0.2, 0.2, 0.2, 0.3 > respectively in searching. Clearly show the steps of your calculations

Given a sequence of 5 element keys < 23, 26, 16, 38, 27 > for searching task:
a) Given the hash function H(k) = (3.k) mod 11, insert the keys above according to its original sequence (from left to right) into a hash table of 11 slots. Indicate the cases of collision if any.

b) In case of any collisions found above in a) part, determine the new slot for each collided case using Linear Probing to solve the collision problem. Clearly show your answer for each identified case. No step of calculation required. (Answer with “NO collision found”, in case there is no collisions found above)

c) In case of any collisions found above in a) part, determine the new slot for each collided case using Double-Hashing (with functions below) to solve the collision problem. Show your steps and calculations with a table as in our course material. d1 = H(k) = (3.k) mod 11 di = (di−1 + ((5·k) mod 10) + 1) mod 11 , i ≥ 2 (Answer with “NO collision found”, in case there is no collisions found above)

​​​​​​​d) Suppose the given sequence < 23, 26, 16, 38, 27 > is stored in linear structure of an array (stored from left, as the beginning of the array) for simple sequential searching, find the average search length (ASL) if they have probabilities < 0.1, 0.2, 0.2, 0.2, 0.3 > respectively in searching. Clearly show the steps of your calculations.