An array A contains n-1 integers from 1 to n in increasing order, t.e., one integer in this range is missing Write pseudocode that uses a divide-and-conquer approach taking two parameters as input an integer array A, and the range, n, and returns the missing integer Your algorithm must be recursive Hint Start by comparing the middle element Alm] with m+1 Here is an instance of size n=13 to help you think about the problem. The missing value is 5 2 10 11 A 2 3 4 67 8 9 10 11 12 13 1 2 4 5 7 O 0 1