Question $1$

The recurrence relation of a recursive divide and conquer algorithm is given. Explain

this recurrence, verbally, in terms of the size of each sub$-$problem, the cost of dividing

the problem, and combining solutions.

$T(n)=3T(\frac{n}{4})+2n+n^3$