Suppose you are given a sorted array of n elements which may have duplicates. Write a recursive version of the binary search algorithm, modified so that it finds the leftmost occurrence of the search. For example, for the following array S = {2, 4, 6, 6, 6, 8}, a search on 6 should return 3.