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