An array A[0..n - 2] contains `n-1` integers from 1 to `n` in increasing order. (Thus one integer in this range is missing.) Design an algorithm in $\Theta(\log n)$ to find the missing integer. Your algorithm should be given in **pseudo code**. For example, the array `A` could be `{1, 2, 3, 4, 6, 7, 8, 9, 10}` in which `5` is missing.