Given a sorted list of numbers, write a function named binary$\_$search to search for a given key. If found, your function must return the respective index of search item. If not found, it must return $-1.$ In the case of duplicates, you are not restricted to return the index of the first occurrence. However, you are highly encouraged to return the index of the first occurrence. For example for the list, $[8,10,12,14,16,18,20,22,24,26,30],$ your function must return $7$ for search key $22,0$ for the search key $8$ and $-1$ for search key $13.$

Use your function to search for $26$ in above list in your main program.