Hash Table Practice Problem

5): Suppose you have the following hash table, implemented using linear probing. The hash function we are using is the identity function, h(x) = x. 0 1 2 3 4 5 6 7 8 9 18 12 3 14 4 21 In which order could the elements have been added to the hash table? There are several correct answers, and you should give all of them. Assume that the hash table has never been resized, and no elements have been deleted yet. For the choice(8) you, discard you need to give reason why you didn't choose them. A B D E 9, 14, 4, 18, 12, 3, 21 12, 3, 14, 18, 4, 9, 21 12, 14, 3, 9, 4, 18, 21 9, 12, 14, 3, 4, 21, 18 12, 9, 18, 3, 14, 21, 4