Quick Please

This question is in two pictures but it is MCQ

Question 5 1 Point Assume you have a hash table of size 13, 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. 25, 66, 710, 150, 82, 111, 70,17 index key 1 2 66 3 4 A A 5 82 6 70 7 17 8 150 9 710 10 111 11 12 13 25 index key 0 1 66 2 O Nm 3 4 82 5 70 6 17 B 7 150 8 710 9 111 10 11 12 25 index key 0 1 66 2 3 4 82 5 70 6 17 7 150 8 111 9 710 10 11 12 25 index key 0 1 66 2 3 D 4 82 5 70 6 17 7 150 8 710 9 111 10 11 25 12