In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving collisions by linear probing is (assume uniform hashing).
(A) 2/3
(B) 1/3
(C) 1
(D) 1/6