4 Proving a Function Correct (4 points) 5.2 Why was it necessary to introduce the new local n in the second version of compute.sc above? In this question, we'll do part of the proof of correctness for a function compute_square relative to a specification function SQUARE. We won't prove that the loop invariants are true initially, and we won't prove that they're preserved by an arbitrary iteration of the loop int compute_square(int n) { int total = 0; while in > ) { total += 2-n - 1; Give a suitable extra invariant that would allow us to prove the function correct. //@loop_invariant when the loop ter- Which line numbers would we point to to justify that n == minates? return total; 5.1 Complete the specification function below with the simple mathematical formula that gives the square of the numbers 13. int SQUARE(int n) 2//@requires Ocn && n 0) //@loop invariant 0