java

2. Algorithm Analysis Evaluate the running time T(n) in terms of big-theta, for each of the following of code. Justify your answer. int k = 0; for (int j=0; j= 1) { 3 for (int j=n; j > #D4; j - j - (1 + #05)) k += 2 + #D3; z = z/2; 4 4 ) (d) (5) int a = 0, 0 = 0; for (int j=1; j <>