data structure in c language :

In the following questions, the set of input data is based on your student ID. The set of numbers you will extract is as follows: N1 = 1st digit; N2 up to N7 = the set of pairs in your student ID; N8 = the last digit in your student ID. For example, if your student ID is 1171234, then show the extracted pairs in a table containing each pair of consecutive numbers as follows: N1 N2 N3 N4 N5 N6 Original 1st St.ID digit Last digit 11712341 11 17 71 12 23 34 4 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