Cognizant Hash Table Quiz

The concept of linear probing is that collisions are resolved by sequentially scanning the array until an empty location is found.
In this case we need to store at Location 2 , so we can go to that location only if we receive locations to be 7,8,9,10,1 ( these locations are already filled so it will scan for an empty location i.e. 2 ) and location 2 of course.
So probability would be = favorable locations/total locations
=6/10
=0.6