Are the following languages Turing-decidable? Turing-acceptable but not Turing-decidable? Not even Turing-acceptable? For each answer, just give an intuitive explanation of your reasoning, no formal proof is required:

{(M) :|L(M)| 10}

{(M) :|L(M)| 10}

{(M)(w) :M w in 10 steps or less}

{(M)(w) :M w in 10 steps or more}