Given input keys {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x mod 10, draw the resulting hash table, if collisions are resolved with chaining. Make sure you label the indices of your table. Assume new elements are added to the front of a linked list.