8. (5 points) Consider hashing the following number using a hash table T of size 10. Use the hash function h(k) = k mod 10 and linear probing to resolve collision. What does T look like after hashing all numbers? A = (3, 13, 4, 7, 1, 15, 16, 6, 14, 12) A. (6,1, 12, 3, 4, 13, 15, 16, 7, 14) B. (14, 1, 12, 3, 13, 4, 15, 7, 16,6) C. (3, 1, 12, 13, 14, 15,6, 16, 7, 4) D. (6,1, 13, 3, 4, 15, 16, 7, 12, 14)