List of keys$(k)=6,17,23,34,48,99$ are inserted into the hash table by using hash function $H=k$ mod table size and table size is $10.$ For resolving collisions linear probing used.

Number of collisions occurred when we insert new element $\text{'}103\text{'}$ is

Show all steps.

$[$Show each step$]$