Problem 1 Post condition Consider the foliowing code Assume that x ib say real number P-1: 1-1 while (in)f ii+ 1 return p: 1. Find two non-trivial loop invariants that involve variables i, and p (and n which is a constant) They mast be strong enough to get the post condition. 2. prove that each one is indeed a loop invariant. 3. What does this program compute? 4. Use the loop invaraints and post
OR
OR