Consider the set of points $x_j=j/t,\ j\in\{0,1,\dots t\}$ (so we have equally spaced points on the unit interval). The lagrange basis polynomials are $$L_j(x)=\prod_{0\le m\le t,\ m\ne j}\frac{x-x_m}{x_j-x_m}=\prod_{0\le m\le t,\ m\ne j}\frac{x-\frac{m}{t}}{\frac{j}{t}-\frac{m}{t}}=\prod_{0\le m\le t,\ m\ne j}\frac{tx-m}{j-m}$$
If I calculated the double derivative of this correctly, we should be getting $$L_j''(x)=\sum_{\ell\ne j}\frac{t}{j-\ell}\left(\sum_{m\ne (j,\ell)}\frac{t}{j-m}\prod_{k\ne(j,\ell,m)}\frac{tx-k}{j-k}\right)$$ I suppressed the lower and upper limits, they are still from $0$ to $t$. I would like a good upper bound on $L_j''(1)$. My gut feeling tells me this is $\mathcal{O}(\text{poly}(t))$ but the naive bounds are all exponential.
Can this be shown to be upper bounded by a polynomial in $t$?
For context, I need to understand this term for a particular approximation scheme of polynomials given random but controlled evaluations. I was previously stuck on an approach (and had asked on mse), but if we can show this then we will be done!