this is related to algorithm.

Problem 10. An array A of n integers is called semi-sorted if it is increasing until some index and then decreasing afterwards. In other words, there is some index 1

A[i+1] for p A[i+1] then the maximum is in A1,...,1). For correctness, if your algorithm uses a loop, formulate a loop invariant (LI) - what remains to be true throughout all iterations of your loop so that when the loop terminates, LI implies that the maximum element of A is found? If your algorithm is defined by recursion, use Induction to prove the correctness