What is the running time of the following algorithm (using big-O notation)? Show your analysis in two ways: (1) a detailed analysis which counts the number of times each line of code executes, (2) using simpler analysis with big-O notation. 1: result 1 2: for i=1 to n do 3: for j=1 to i do 4: result result +1 5: end for 6: end for