Please include explanation. Thanks

(8 points) Linear Probing: The following hash table was created using linear probing: Hash function: h(x)-(5 *x)%g 3 4 5 6 11 3 12 23 19 a. (3 points - Correctness) List all of the elements that could have been inserted into the hash table first b. (3 points - Correctness) List all of the elements that could have been inserted into the hash table last. c. (2 points - Completeness) Provide a possible insertion order of the elements