consider a hash table of size 10 that employs open addressing with linear probing. The hash function is given by h(k)=k mod 10. The hash table contains bins indexed from 0 to 9. A sequence of records with keys given below is inserted into an intially empty hash table.
83,84,95,74,23,86,41,62,72.
The number of unsuccessful probes required to find the index of bin which contains the last elements is______________________.
