Questioni Consider an array A[1..n] of random length and random positive integer values. We define a subarray of A as a contiguous segment of A. We denote the subarray from position k to position (both included) as A[k...]. The subarray A[k..l] is an ascent if A[j] = A[j + 1] for all j whereksj