$[24$ points$]$ For each of the languages below, indicate whether or not it can be proved undecidable usingRices Theorem. In each case, justify your answer. $($a$)$ L$1=\{$M $|$ M accepts $0$ k $2$ for each integer k$\}($b$)$ L$2=\{$M $|$ M accepts either M or M R$\}($c$)$ L$3=\{$M $|$ M does not accept exactly $303$ palindromes$\}($d$)$ L$4=\{$M #w $|$ M accepts ww in at most $|$w$|2$ steps$\}($e$)$ L$5=\{$M $|$ M is a TM and L$($M $)$ is finite$\}.($f $)$ L$6=\{$M $|$ M is a TM and L$($M $)$ is a subset of $\}.$