Give asymptotic upper bound for

$$

$($

$$

$)$

T$($n$)$ in each of the following recurrences. Assume that

$$

$($

$$

$)$

$=$

$$

T$($n$)=$n for

$$

$<=$

$2$

n$<=2.$ Select the tightest bound from the available options, and the method you used to obtain it$.$

Q$2\mathrm{.}11$ Point

Grading comment:

$$

$($

$$

$)$

$=$

$$

$($

$$

$$

$6$

$)$

$+$

$128$

T$($n$)=$T$($n$6)+128$