4 Proving a Function Correct (4 points) 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 (n > 0) { total += 2*n - 1; return total; 5.1 Complete the specification function below with the simple mathematical formula that gives the square of the numbers n. int SQUARE(int n) . //@requires 0) //@loopinvariant