Degree powers and number of stars in graphs with a forbidden broom

Given a graph $G$ with degree sequence $d_1,\dots ,d_n$ and a positive integer $r$, let $e_r(G)={\sum }_{i=1}^n{d}_i^r$. We denote by ${\mathrm{e}\mathrm{x}}_r(n,F)$ the largest value of $e_r(G)$ among $n$-vertex $F$-free graphs $G$, and by $\mathrm{e}\mathrm{x}(n,S_r,G)$ the largest number of stars $S_r$ in $n$-vertex $F$-free graphs. The $\mathit{\text{broom}}$ $B(\mathrm{\ell },s)$ is the graph obtained from an $\mathrm{\ell }$-vertex path by adding $s$ new leaves connected to a penultimate vertex $v$ of the path. We determine ${\mathrm{e}\mathrm{x}}_r(n,B(\mathrm{\ell },s))$ for $r\ge 2$, any $\mathrm{\ell },s$ and sufficiently large $n$, proving a conjecture of Lan, Liu, Qin and Shi. We also determine $\mathrm{e}\mathrm{x}(n,S_r,B(\mathrm{\ell },s))$ for $r\ge 2$, any $\mathrm{\ell },s$ and sufficiently large $n$.