Answer question 6 For a Turina mact strings acoepted by M. A sangunge is Turing recognizable if some Turing machine recognizes it. 1 2 Problem Show that the language F={MM is a Turing machine, and L(M) contains infinite elements is not Turing recognizable..