Let S, N N. Using the notation weve used in class, write a simple loop for computing S^N

Provide a loop invariant, p, for your code, and prove its correctness by showing that pB {S} p is a good Hoare triple

(p 1 B){S}p p{while B do S}(P1-B) Use the While loop inference rule above, and the fact that p is a good loop invariant, to prove that your code outputs SN. (p 1 B){S}p p{while B do S}(P1-B) Use the While loop inference rule above, and the fact that p is a good loop invariant, to prove that your code outputs SN