$(1)5$ netaton of

$T(n)=\{\begin{array}{cc}4T(\frac{n}{4})+cn,& n2\\ k,& n=1\end{array}$

$H+$ Consider $n=4^k$

$(2)$ Let $T(n)$ be the totd running time of the following recursive fon on on inpont of size n$.$e Write rec. relation for $T(n).$

My Func $($A$[],$ stant, end$)$

if start $$ end:

$m_1=$ stant $+\frac{\text{e}\text{n}\text{d}-stant}{4}$

$m_2=$stat$+2\frac{(\text{e}\text{w}\text{l}-\text{s}\text{t}\text{a}\text{t})}{4}$

$m_3=$ start $+(3(an)-$stat$)$

else:

$11$ f$.$lm of assiguments

$($A$)$ Write suce for

Marge $($A$[$J$,ab,c,d$

whica menges range $a-b$ whth range $c-1$ in arrey $A.$

OR

$($B$)$ Write aste for $k-$hop granch for $k=14$ on on array of size $n.$ Dort forget the are if $14$ doesn't parfectly dirite $n.$ What's the worst case of number of componims of yar cote for $n=300.$

$(4)$ Consiter this Mengesont for: Menge ort $($A$[],$ start, end$).$

if staut