help please !! due in a bit!!

Show your work. (10 pts a Calculate the running time for the following code fragment Algorithm test int counter, i,J counter 0; counter := counter +1 h pair of expressions (A.B) in the table below whether A has a smaller b. Indicate for each of 8, same order of growth as B, or larger order of growth than 8 within a constant multiple). Justify your answer [10 pts.] A has a smaller order of growth Same order of growth A has a Larger order of Function A Function B th 2000 n28 100 lg ig n 2log n 0.001 n3 -2n