You have an array A of size N, filled with integer values at random. Your task is to find the maximum value neighboring pair in the available array. You are not allowed to sort the array. You have to design this solution through divide and conquer. Your solution should return two values, the first sum of the pair, the second starting index of the pair. After this solution, can you find both integer values that are selected from the given array for the maximum value neighboring pair, from the given information?