$.$ Obtain the recurrence relation for the given algorithms.

$2.$ Solve the recurrence relation to get the run time complexity of the algorithm in the form T $($n$)=($f $($n$))$

procedure func$($n$)$

if n $1$ then

return $1$

for i $1$ to $$n do

print $$Algorithms$!$

lef t result $$ func$($n$/4)$

right result $$ func$($n$/4)$

return lef t result $+$ right result $+$n

procedure recursion$($n$)$

if n $1$ then

return $1$

lef t result $$ func$($n $1)$

right result $$ func$($n $1)$

return lef t result $+$ right result