Answer question 1 in the format provided please

Q1. The following algorithm finds the maximum element in the given array. Prove the correctness of the algorithm. In addition, analyze its time complexity in the worst-case and best-case scenarios def max (A) m = A[0] for i = 1 to n-1 do if A[i] > m then m = return (m) A[i] Loop Invariants To prove correctness using loop invariant, we must show: Initialization: The invariant is true prior to the first iteration of the Base case loop. Maintenance: If the invariant is true before an iteration of the Inductive step loop, it remains true before the next iteration. Termination: When the loop terminates, the invariant gives us a useful property that helps show that the algorithm is correct