$($b$)f(n)=O(g(n)),$ where $f(n)=19n+15$

Question $2(10$ points$)$: Consider the following alo

Algorithm $1$ The recursive function Print Things

$,$function PRINT ThINGS $(A)$ :

$,,$nlarr length of $A$

$,,$if $n4$ then

$,,,$return

$,$for $i=0,1,$dots,$n-1$ do

$,,$for $j=0,1,$dots,$n-1$ do

$,,,pr{\displaystyle \underset{\phantom{}}{\overset{\phantom{}}{}}}(A[i])$

$,,,$print$($A$[$j$])$

$,$PrintThingS$(A[$:$\frac{n}{5}]$

$,$PrintThings $(A[3\frac{n}{5}$:$])$

What is the asymptotic running time of PrintThingS$($A$)$ if the length of $A$ is $n?$

We expect: an answer like "The running time of PRINTThings$($A$)$ is $O(dots)"$ with a short explanation.