##### Find the total number of probes that occur while hashing five strings using linear probing.

Consider the following, five binary strings of length 8.

01010010, 11011011, 10011010, 11111011, 01110010

A hash table of size M = 8 (0 to 7) is using open addressing for hashing the

binary strings. Assume finding an empty slot directly without collision or after

collision is also a probe. The total number of probes that occur while hashing

five strings using linear probing are ______.

Thank you! :)

I was trying to convert binary string to decimal and then solving it :P :D