lgorithms [5 Points] Divide and Conquer: Assume that you are given an array with n elements all entries equal either to 0 or +1 such that all 0 entries appear before +1 entries. You need to find the index where the transition happens, i.e. you need to report the index with the last occurrence of 0 . Give an algorithm that runs in time O(logn). Explain your algorithm in words, describe why. the algorithm is correct, and justify its running time