What is the complexity of the following recurrence relation? Please state it with big$-$theta notation.

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

$$

$$

$$

c$0,$ n $=1$

$4$T

$($n

$4$

$)$

$+16$n $+$ n

$2+$ c$,$ n $>1$