hw help please!!!

4. (40 pts) [Asymptotic Complexity] Consider the given pseudo code. Write the function T(n) in terms of the number of operations, and then give the asymptotic (big Oh) complexity of the algorithm, show all the work you do. [ write the summation formula and solve it, or use the Look for pattern'method. a. Matrix Multiplication b. T(n) denotes the number of the times the statement "CSE 4310F is printed as a function of n. for i=1 to n/2 do for j=i to ni do for k=1 to j do print "CsE 4310! " c. T(n) denotes the number of the times the statement: k=k+1 executed int 1,j,k=0 : for (1=n/2;1n;1++} L for [j=2;j=0ty=2) f print ( Hellog = y 1 1