Given an array storing integers ordered by value, modify the binary search routine to return the position of the first integer with value K in the situation where K can appear multiple times in the array. Be sure that your algorithm is Θ(log n), that is, do not resort to sequential search once an occurrence of K is found.