A polynomial $\rm\,f(x)\,$ has a root ("zero") $\rm\,r\,$ of multiplicity $\rm\,\color{#c00}n\,$ if $\rm\ f(x) = (x-r)^{\large\color{#c00}n} g(x),\,$ for $\rm\,g(r)\ne 0.\,$ Recall by the Factor Theorem $\rm\,f(r) = 0 \iff x-r\ $ divides $\rm\, f(x).\,$ The multiplicity $\rm \,\color{#c00}n\,$ of root $\rm\,r\,$ simply counts how many factors of $\rm\ x-r\ $ occur (the "degree" or "order" of the root $\rm\,r$).
Your case $\rm\ (x-3)^4(x-5)(x-8)^2\ $ has $\ 4 + 1 + 2\ =\ 7\ $ roots (zeros) counting multiplicities since the roots $\ 3\,,\,5\,,\,8\ $ have multiplicity $\rm\ 4,\,1,\,2\ $ respectively. Note that if we view the roots as a multiset $\rm\ \{3,3,3,3,5,8,8\}\ $ then the multiplicity of a root is simplicity its multiplicity in this multiset, i.e. the number of times that it occurs.
Abhyankar, a master of algebraic geometry, remarks in his charming exposition [1] that
... much of algebraic geometry ultimately gets reduced to the following Fundamental Principle (plain or supplemented).
Fundamental Principle. $ $ The number of roots (or irreducible factors) of a polynomial $\rm\,f(x)\,$ in one
variable, counted with their multiplicities (resp. degrees and multiplicities), equals the degree of $\rm\,f(x).\,$
It is certainly the algebraical key to the various 'counting properly.'
I highly recommend reading Abhyankar's paper. It explains simply and beautifully much more than how to algebraically count properly. Indeed, it won various prestigious awards for expository excellence (AMS Lester R. Ford, MAA Chauvenet Prize).
[1] Abhyankar. Historical Ramblings in Algebraic Geometry and Related Algebra
Amer. Math. Monthly 83 (1976), 409-448