Give a big-O upper bound of the operations performed by the following algo- rithm (do not count calculations performed inside for-loops). 2pts.

k := 0

for i = 1 to n

for j = i to n k := k + 1