Include its pre-conditions and post-conditions. Finally, prove by induction that the recursive algorithm is correct

Given the following iterative algorithm which computes the

nth triangular number:

int tri(int n)

{

int result = 0;

for (int i = 1; i = n; i ++)

result += i;

return result;

}

Convert this function to use recursion. Include its pre-conditions and post-conditions. Finally, prove by induction that the recursive algorithm is correct