PROBLEM 2 algorithm design (40 points) Find the Missing Integer You are given a sorted array of N distinct integers drawn from f0.N) (you know this ahead of time) Since there are only N array entries and there are N+1 distinct values in O..N) exactly one of them must be missing from the array. our 30derize n igerthe to ftsa the misisng ie HINT Think of a "binary-search-like" 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