Need help answering these questions:

2. Insert the following numbers into the hash table (replace the _ in the table). Use linear probing to resolve collisions. 0,8,7, 3. Suppose we are using the hashing function h( key )= key %11 to store the following values: 13,24,35,17,44,31,54, 14, 98, 46. Show where each value is stored in the table below. Use chaining to resolve collisions. You must insert the values i the order they are specified