What is the time complexity of the recursive algorithm T(n)=8T(n/2)+n3T(n) = 8T(n/2) + n^3T(n)=8T(n/2)+n3?
Θ(n3logn)\Theta(n^3 \log n)Θ(n3logn)
Θ(n3)\Theta(n^3)Θ(n3)
Θ(n2)\Theta(n^2)Θ(n2)
Θ(n4)\Theta(n^4)Θ(n4)