data structure in c language :

Question 2) Consider a Hash table of size 13, and the hash function is h(x) = x mod size and consider the original set of pairs generated from your student ID: a. Using linear probing, generate a hash table to store the sequence of numbers and show all your steps (as shown in the lecture) and the change in the hash table. b. Using quadratic probing, generate a hash table of the sequence of numbers and show all your steps (as shown in the lecture) and the change in the hash table