An algorithm A takes $\backslash$Theta $($n

$2$

$)$ time to partition the input into $5$ sub$-$problems of size n$/5$

each and then recursively runs itself on $3$ of those subproblems. Describe the recurrence

relation for the run$-$time T$($n$)$ of A and find its asymptotic order of growth.