Here r d steps though I m getting a different answer.
I've solved dis equation using d Master's Theorem. You can verify d descp. Yeah. :)
Give equation is of d form:
aT(n/b)+f(n)
Here given equation is:
2n(n/2)+nn.
So a=2n, b=2, f(n)=nn
Now a=2n, b=2
Keeping it in logba, we have log22n ,
So we get nlog22 which equals n, since(log22=1).
Now nn thru d form nlogba.
So nlogba is equal to d case II of Master's Theorem.
So T(n) time complexity is given by
T(n)=θ(nn log2n)
is d final answer. :)