Q1 Loop invariants 10 Points Consider the following code, assuming that i,x, and n are integers, with n1. - State a non-trivial loop invariant (which must include conditions for i and x ). - Prove the loop invariant. Be sure that the proof includes the final conditions after the loop has ended. - Note: a correct proof of an incorrect invariant will still receive partial credit. - Give the final value of x in terms of n. - Note: (for the sake of readability) the value 2i is 2 to the power of i. After the loop, x=