The recurrence T(n)=2⋅T(n/2)+nT(n) = \sqrt{2} \cdot T(n/2) + nT(n)=2⋅T(n/2)+n with T(1)=1T(1) = 1T(1)=1 has what asymptotic complexity?
Θ(n)\Theta(n)Θ(n)
Θ(nlogn)\Theta(n \log n)Θ(nlogn)
Θ(nlog22)\Theta(n^{\log_2 \sqrt{2}})Θ(nlog22)
Θ(n2)\Theta(n^2)Θ(n2)