For this pseudocode present a loop invariant and prove it, n >= 0.

i <= 0;

s <=2;

while i < n do

i <= i + 1

s <= s * s