Master's Theorem Recurrence Relation

Question

T (n) = T (n/2) + 2ⁿ

Using Master's Method What is the Complexity Of This Recurrence Relation?

Or Using AnyOther Method?

 

Comments

how can u apply master's theorem if it is not in the form of msters theorem??

---

It's in the form..that is what i stated in the comment..have a look.. also visit the link for details..

---

ma'm it is basic masters theorem. plese clear my doubt--

https://gateoverflow.in/235523/masters-theorem