$1.($i$)$ Set up time complexity for the following programs and solve the following recur$-$ rences:

L $=($l$1,$l$2...$ln$)$ is a list of size n

SolveProb$($L$)$

$\{$

If n $>1\{$

SolveProb$($L$1=($l$1,$ l$2...$ ln$1))$

SolveProb$($L$2=($l$2,$ l$3...$ ln$))$

SolveProb$($L$3=($l$2,$ l$3,...$ ln$1))\}$

$\}$

$($ii$)$ Solve the following recurrence:

T$($n$)=4$T$($n$1)+2$n $,$n$>0$

with T$(0)=1.$

$($iii$)$ Solve

T$($n$)=8$T$($n$1)16$T$($n$2),$ n$>1$

with T$(0)=2,$T$(1)=10$