You are given a sorted array A=[a1,a2,,aN], consisting of N distinct integers, along with a lower bound and an upper bound u. Design a Divide and Conquer algorithm that finds the number of elements in A between and u inclusive. Example: if A=[2,4,5,7,9,11],=2 and u=5, your algorithm should output 3 . Example: if A=[2,4,5,7,9,11],=4 and u=10, your algorithm should output 4 . Describe your algorithm in words (no pseudocode!) and justify its correctness. State and justify its runtime. Faster (and correct) in asymptotic Big O notation is worth more credit