I need complete solution for this question

Its from Algorithms and Complexity

1 Time analysis 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. : result1 2: fori to n do 3: for j-1 to i do result result + 1 end for 5: 6: end for 2 Asymptotic Notations For this problem, you need to base your answer on the definitions of the asymptotic notations (not the common sense rus 1. Show 8n314n2 -e(nlogn). 2. I f(n) O(g(n)), can we conclude )(2) Justify your answer 3. Prove for any integer constant a and real constant b, (n + b)"-e(n). In fact, this holds even when a is a real constant, but you do not have to prove it