Insert integer keys A [67, 13, 49, 24, 40, 33, 58] in order into a hash table of size 9 using the hash function h(k) = (11k + 4) mod 9. Collisions should be resolved via chaining, where collisions are stored at the end of a chain. Draw a picture of the hash table after all keys have been inserted. (b) [1 points] What is the maximum chain length of this hash table? (c) [2 points] Suppose the hash function were instead h(k) = ((11k + 4) mod c) mod 9 for some positive integer c. Find the smallest value of c such that no collisions occur when inserting the keys from A.