C-1. Given a hash table of size 11, a hash function h(k), and input keys are 25, 35, 80, 36, 56, 31, and 85 in that order), draw the hash table that results from: a) Linear probing with h(k)= k % 11. (3 marks) b) Double hashing with h(k) = k % 11, and g(k) = 1 + (k % 10) as the secondary hash function. (3 marks) c) Find h4,4(k) with p=101 and if collision, use chaining method to resolve it. (4 marks