The recurrence T(n)=2T(n−1)+1T(n) = 2T(n-1) + 1T(n)=2T(n−1)+1 with T(0)=0T(0) = 0T(0)=0 describes a recursive algorithm. What is Θ(T(n))\Theta(T(n))Θ(T(n))?
Θ(n)\Theta(n)Θ(n)
Θ(n2)\Theta(n^2)Θ(n2)
Θ(2n)\Theta(2^n)Θ(2n)
Θ(nlogn)\Theta(n \log n)Θ(nlogn)