Use the recursion tree method to solve

T$($n$)=$ T$($n $$ c$)+$ T$($c$)+$ f$($n$)$

where c$=$ is a constant and T$($c$)=$ c

$($a$)$ f$($n$)=$ log log n

$($b$)$ f$($n$)=$

n

Repeat the above for the recurrence

T$($n$)=2$T$($n$/2)+$ f$($n$)$

where T$(1)=1($assume n is a power of $2)$