A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is

• A. 0.1
• B. 0.6
• C. 0.2
• D. 0.5