3. [4 marks] For this question, I have provided a while loop and a loop invariant. Let P(k) be the predicate: "LoopInv is true when the loop condition is checked for the kth time". For an arbitrary k > 2, I would like you to write a full proof of the following statement: P(k-1) = P(k). Algorithm 3 1: //LoopInv: a + b 2: while a > 0 do 100 a + a +1 3: b+ b 1 4: 5: end while