Java:

*Use summation

Assume the complexity of T(n) of a recursive algorithm is:

T(n)=T(n-1)+n/2 , for n>2 and T(1)=1

Derive a closed form (not Big-O) for T(n).

What is the exact number of assignment statements of the following? State as T(n) (CLOSED FORM NOT BIG-O).

* Do not count assignments inside loop headers

int x=0;

for (int i=0; i

{

for (int y=2; y<=i+1; y++)

{

x=x+i+y;

}

x=x+1;

}