re the following languages Turing$-$decidable? Turing$-$acceptable but not Turing$-$decidable?

Not even Turing$-$acceptable? For each answer, give an explanation of your reasoning $($just as

in class, M is a generic deterministic Turing machine, w a generic input string to it$,$ and $\backslash$rho is

an encoding function$).$

$$ L$1=\{\backslash$rho $($M $)$ : $|$L$($M $)|>10\}$

$$ L$2=\{\backslash$rho $($M $)$ : $|$L$($M $)|<=10\}$

$$ L$3=\{\backslash$rho $($M $)\backslash$rho $($w$)$ : M $$ w in $10$ steps or less$\}$

$$ L$4=\{\backslash$rho $($M $)\backslash$rho $($w$)$ : M $$ w in more than $10$ steps$\}200$