Algorithm 1 A more interesting double loop 2: fori 1 ton do 3: 4: for j = i + 1 to n do 5: 6: 7:end for 8: end for k=k+2 k=k+2 Do some other computation involving (n2) operations (a) What is the value of k after Algorithm 1 has executed? Show your workings. (b) Using notation, calculate the complexity of the entire algorithm. (c) Can you state the complexity of this algorithm using big O notation? Explain