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