Choose the correct answer please

Assume you have a hash table of size 11, insert the following keys using open addressing with linear probing, assuming that the H(Key) = key % size and the bucket size is equal to 1. 763, 300, 120, 76, 230, 45, 70 index key 1 76 2 230 3 45 4 300 A 5 763 6 70 000 8 9 10 11 120 index key 0 76 1 230 2.45 3 300 4 763 5 70 B 6 7 8 9 10 120 index key 0 76 145 2 230 3 300 4763 5 70 6 7 8 9 10 120 index key 0 230 1 76 245 3 300 4 763 570 D 6 7 8 9 10 120