PROBLEM 2 algorithm design (40 points) Find the Missing Integer. You are given a sorted array of N distinct integers drawn from 0.N(you know this ahead of time) Since there are only N array entries and there are N+1 distinct values in [0..N], exactly one of them must be missing from the array Your job: devise an Olog N) time algorithm to find the missing integer HINT: Think of a "binary-search-1ike" approach. COMMENT: You can present your algorithm as a c function but, you must also include an explanation of why it works- i.e., the underlying logic of your solution