Question $1$: Randomised Recurrence

Given the following recurrence relations, derive their closed forms by drawing a recursion tree and$/$or using algebraic manipulation, and then enter your closed forms in the corresponding textboxes below.

$S(n)=\{\begin{array}{ccc}28,& \text{f}\text{o}\text{r}& n=1\end{array}$

$11S(n-1)+28n,$ for $n>1$

$S(n)=$