Let $0<\backslash$lambda $<1<$ a $<$ b be constants. Solve the following recurrences using Master Method, noting

the case that applies.

$($a$)$ T$($n$)=$ bT$($n$/$a$)+\backslash$Theta $($n$).$

$($b$)$ T$($n$)=$ a

$2$T$($n$/$a$)+\backslash$Theta $($n

$2$

$).$

$($c$)$ T$($n$)=$ T$(\backslash$lambda n$)+$ n

$\backslash$lambda

$.$

$($d$)$ T$($n$)=$ aT$($n$/$a$)+\backslash$Theta $($n

$\backslash$lambda

$($log n$)$

b

$)$