please answer all of the question

Give an expression for the exact running time T(n) and the simplest asymptotically tight bound g(n) on the running time (i.e. (n)=(g(n))) for each of the following fragments of code. Assume each statement requires 1 time unit to execute, and we will not count an extra execution of a "for statement" for loop for(i=1;i