1. A closed hash table with length 13 is used to store positive integers, using linear probing to resolve collisions. The hash function value for an integer N is simply the remainder N9613. Suppose that the following numbers are inserted into the table in the order shown, starting with an empty table: 131 32 818 295 88 204 55 321 419 492 a) Draw the closed hash table, showing the contents of the hash table after this sequence of insertions b) Now, explain carefully how to search the table to check if the number 321 is present. (What steps are followed, and why?) Do the same for the number 16