Find the loop invariant, variant and weakest pre-condition in the following function. Prove total correctness of this function. What do you think this function is computing. int funl (int x) { int y = 1; int z = x; while (z > 0) { y = y N = N * - z; 1; } return y;