4. (25 points) Let there be an array A[1,2,,n] of numbers and we wish to find the longest increasing consecutive sub sequence. Specifically we wish to find indices i,j such that ij and A[i]A[i+1]A[j] Example: If the input array is 4,1,3,5,6,7,5,8,2, then the algorithm should return 1,3,5,6,7 Design an O(nlogn) time divide and conquer algorithm for this