Show all loop invariants$($self$-$contained proposition that can be used to prove the correctness of the algorithm for the algorithm below.

$//$Input: array of real numbers, size of array

i $<--$ n

x $<--$ A$[$n$]$

y $<--$ A$[$l$]$

while$($i$>0)$ do

if A$[$i$]$y then

y $<--$A$[$i$]$

i $<--$ i$-1$

return y$-$x