Can you send a tree showing the process

Consider the SDT schema given below with non$-$terminals $\{$A$,$ B$,$ C$\}$ and terminals $\{$a$,$ b$,$ c$\}$

$(10$ marks$)$

S $->$AC $\{$print $*\}$

S $->$ aB $\{$print $***\}$

A $->$ Sb $\{$print $**\}$

B $->$ c $\{$print $*\}$

C $->$ S $\{$print $*\}$

Using the above SDT$,$ calculate the total number of $*$ that are going to be printed in the output

for the input $$acbac$.$