Consider the following divide-and-conquer algorithm that assumes a global array A of integers: MYSTERY(integer left, integer right): if left == right: return (1, 1, 1) else: m = (left + right) / 2 (integer divide) (part1Lrun, part 1Rrun, part1maxrun) = MYSTERY (left, m) (part2Lrun, part2Rrun, part2maxrun) = MYSTERY (m+1, right) if A[m]