Let (0, 1}. Your friend claims that it is easy to create Turing Machines which accept strings which only contain O's, i.e. 0, 00, 000, etc. They then claim, that therefore, al languages which only contain strings made exclusively from O's are decidable. Formally prove your friend wrong. [10]