Problem $1.$ Express the worst case running time of each of the following functions as a recurrence relation.

Be sure to include a base case.

YOU DO NOT NEED TO ANALYZE THE RECURRENCE RELATION

$($a$)1$: function Func$($A$[],$n$)$

$2$: if n $<=4$ then

$3$: return A$[1]$

$4$: end if

$5$: x $=0$

$6$: for i $=1$ to n do

$7$: for j $=1$ to n do

$8$: x $=$ x $+$ i $$ j

$9$: end for

$10$: end for

$11$: x $=$ x $+$ Func$($A$[],$n$/6)$

$12$: return x

$13$: end functio