Write the recurrence relation of the function "func".$[2]$

Calculate the time complexity of the recurrence relation using any of the methods. $[3]3.$ Analyze the code snippet and answer the following questions:

$```$

int func$($int n$)\{$

if $($n

return $1$;

$\}$ else $\{$

int a $=0$;

for $($int i $=0$; i $<mtext></mtext><mn>4</mn>$; i$++)\{$

a $+=$ func$($n $/4)$;

$\}$

int b $=$ func$2($n$)$;

return a $+$ b;

$\}$

$\}$

int func$2($int n$)\{$

int c $=0$;

for $($int k $=$ n; k $>=1$; k $-=3)\{$

for $($int m $=0$; m $$ n; m $+=2)\{$

c $+=$ k $+$ m;

$\}$

$\}$

return c;

$\}$

$```$