Say you are to prove the following using our axiomatic scheme.
What is the loop invariant that will allow you to write the proof? Do not write the proof, just the invariant. Partial credit will be given for partially correct invariants.{ n = 2k AND k >= 0 } -- The caret `^' represents exponentiation i := 0; j := n; while j > 1 loop j := j / 2; i := i + 1; end loop; { n = 2i }