Running time T$($n$),$ where n is input size of a recursive algorithm is given as follows:

T$($n$)=$

$$

$$

$$

$>+$

$=$

$1(/2)1$

$11$

n if T n The time complexity of the algorithm is

a$)$ O$($n$2)$

b$)$ O$($n log n$)$

c$)$ O$($n$3)$

d$)$ O$($nn$)$

e$)$ O$($log n$)$