Consider a hash table with 9 slots. The hash function is \(h(k) = k \ mod \…

Consider a hash table with 9 slots. The hash function is $h(k) = k \ mod \ 9$. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are