Please help! How would I do this? Given the input {4371, 1323, 6173, 4199, 4344, 9679, 1989, 2525}, a fixed table size of 10, and a hsh function of H(X) = X % 10, show the result of inserting all of the elements using separate chaining to resolve collisions. (Place null in the unused locations.

If multiple elements are in the same location, add to the front of the chain and separate elements with a comma and a space. For example: 1234, 2234, 3334)