Please develop a Pseudo code as required!! and briefly justify the motives behind the design then answer b (Don't copy answers already posted here on Chegg)

Question i 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 l (both included) as A[k...]. The subarray A[k..I) is an ascent if A[j] = A[] + 1] for all j where ksj