Consider a hash table of size 10 that uses open addressing with the linear probing. Let h(k)=K mod10 be the hash function used .A sequence of records wit keys:83,84,95,74,23,86,41,62,72 is inserted into initially empty hash table ,the bin of which are indexed from 0 to 9 .the number of unsuccessful probes to find the index of bins which contains last element