First I will explain $L_2$
$L_2$ :{<M>|M is a Turing Machine, |M| < 200 where |M| is number of states in machine }
Rice theorem is applicable to non-trivial language property
$L_2$ is not a language property, it is a machine structure property
so, Rice theorem is not applicable here
but it is decidable because from TM description we can determine the number of states in the TM
$L_1$ :{<M,q>|M is a Turing Machine that visits state q on some input within 15 steps}
$L_1$ is also not a language property, but it is also not a machine structure property
so, Rice theorem is not applicable here
but it is also decidable because we can simulate the TM for 15 steps