4. (G-Required) [20 points] Use a loop invariant to prove that the following algorithm computes n!: Factorial (n) it 1 factorial + 1 while (isn) factorial + factorial * i it i + 1 return factorial