List the invariant assertions at points $A, B, C,D,$ and $E$ in program given below:
Program division (input, output)
Const
dividend = 81;
divisor = 9;
Var remainder, quotient:integer
begin
(*(dividend >= 0) AND (divisor > 0)*)
remainder := dividend;
quotient := 9;
(*A*)
While (remainder >= 0) do
begin (*B*)
quotient := quotient + 1;
remainder := remainder - divisor;
(*C*)
end;
(*D*)
quotient := quotient - 1;
remainder := remainder + divisor;
(*E*)
end
https://gateoverflow.in/82425/gate1987-7a?show=316413#a316413
Can someone elaborate the answer given by Arjun sir in the above link?