what is the value is returend by function pesky (n). Express your answer in trems of n . what is the worst case complexity of the nested loop above? what is the right from 1 to 4?

1- pesky (n)= n(n+1)/2. Complexity O(n^2)

2- pesky (n)= n^2(n+1)/2. Complexity O(n^3)

3- pesky (n)= n^2(n+1)^2/2. Complexity O(n^4)

4- pesky (n)= n(n+1)(n+2)/6 Complexity O(n^3)

5- pesky (n)= n^2(n+1)/2. Complexity O(n^4)

Algorithm 1 function Pesky(n) Require: An integer n20 2: for i-1 to n do 3: for j 1 to i do 4: for kj toi +j do 5: 6 end for 7: end for 8: end for 9: return r