computer science - data structures and algorithms question :

please show how did you solve it

The solution to the following recurrence relation T(n)= 2T (n/2) + 4 is Select one: O a. T(n)= O(n^.log(n)) O b. T(n)= O(n^2) 0 c. S(n)= 2(n^3) 0 d. (n) = P(n)