Q.5 Consider a hash table where the size of the array is M-5. If items with keys k = 22; 15; 25; 18 are inserted in that order, draw the resulting hash table if we resolve collisions using: a) Separate chaining with h(k) -(k 2) mod 5. b) Linear probing with h(k) = (k + 2) mod 5. c) Double hashing with h1 (k) = (k + 2) mod 5 and h2(k) = 1 + (k mod 4)