Question: Consider an array A[1..n] of integers. A subarray of A is a contiguous segment of A. We denote the subarray from position k to position l as A[k..l]. The subarray A[k..l] is an ascent if A[j] ≤ A[j + 1] for all j where k ≤ j < l. In other words, an ascent is a nondecreasing segment of A. We want to compute the maximal length of an ascent in A. For instance, for the array A = [3, 1, 4, 2, 4, 4, 5, 3], the maximal length of an ascent would be 4, because the subarray A[4..7] = [2, 4, 4, 5] is the longest ascent in that array. We are interested in an efficient algorithm.
1. Write down pseudocode for an iterative algorithm maxAscent(A) that takes an array A of integers as input and returns the maximal length of an ascent in A.
2. Explain why your algorithm is correct.
3. Implement the algorithm in Java. Provide the argument for the test run in a global variable.