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