Can you explain question 

 

17. Questions 17 to 19 refers to the problem described below You are given a hash table with hash function h(key) = key % 7 and linear probing as its collision resolution. It is known that after a sequence of insertions, the hash table is as shown below. index value 0 1 2 3 4 (empty) 1 23 8 18 A possible insertion sequence to get the hashtable above is a. 1, 18, 8, 5, 12, 23 b. 23, 1, 12, 18, 8, 5 c. 18, 23, 5, 8, 1, 12 d. 1, 5, 18, 12, 23, 8 e. 18, 5, 23, 8, 1, 12 55 62 12 18. The number of possible insertion sequences that will generate the hashtable is a. 180 b. 120 C. 60 d. 240 e. 30