Using $$the loop invariant, prove that the following algorithm computes the maximum value in an array$$A$1$:n$.$ Make sure that your loop invariant

is true at initialization $($i$.$e$.,$ before the loop$$s first iteration$),$

maintains as true before the next iteration of the loop, and

provides a property that proves the algorithm when the loop terminates.

MAX$($A$,$n$)$

$1$m$=$A$[1]$

$2$for$$i$=2$to$$i$$do

$3$if$$A$[$i$]>$m$$then$$m$=$A$[$i$]$

$4$return$($m$)$