Answer is Theta(n). Please include a full solution.

2. [10 Q2. Evaluate the running time T(n) in terms of big-theta, for each of the following pieces of code. No proof bi reoqwired, only the final annwver. (e) You may assume for simplicity that n 2k, for some positive integer k. int a-0, for(i-1 ; i-1; i=n; i=i+2) ji, for(int j=0 ; j++)