Suppose you have a hash table storing integer keys that handles collisions using separate chaining.

If $h(k)=$kmod$12$ what will the hash table look like after inserting the following keys in order into your table?

Keys: $3,7,19,15,4,8,20,16$

Hash table

You may present your answer in the way that you prefer. $($eg$.$ by inserting a table in the text box as above and indicating what will be in each location, OR as a list where each row is an index and you describe what is stored at each index$)$

How many collisions were there?

Make sure you describe how you came up with ALL PARTS of your solution.