2. Let S = {0,1}. Consider the following line of thinking: it is easy to create Turing Machines which accept strings which only contain l's, i.e. 1, 11, 111, etc. Therefore, all languages which only contain strings made exclusively from l's are recognizable. Formally prove or disprove this. (10) 2. Let S = {0,1}. Consider the following line of thinking: it is easy to create Turing Machines which accept strings which only contain l's, i.e. 1, 11, 111, etc. Therefore, all languages which only contain strings made exclusively from l's are recognizable. Formally prove or disprove this