Consider the following languages A $=\{<$ M $,$ k $>|$ M is a TM that accepts all strings of length less than k $\}$ and A $=\{<$ M $,$ k $>|$ M is a TM that accepts some strings of length less than k $\}$ Note the difference between the languages all strings vs some. if M accepts all binary strings of length less than $2(,0,1)$ then is in the language $<$ M $,2>$ in A $$ What are the strings that M needs to accept so that $<$ M $,3>$ in A $?$ List the strings.