(Solved) : 6 Following Use Fact Lm Accept W Atm M Tm Encoded Accepts String W Known Undecidable Prove Q26520231 . . . .

6. For each of the following, use the fact thatLM-accept-w = ATM = {<M,w> | M is a TM(encoded) that accepts the string w} is known to be undecidable.Prove the question is undecidable.

a.   Given a Turing Machine, does the machine acceptexactly two strings from {0,1}*

b.   Given a Turing Machine, does the machine acceptat most two strings from {0,1*

c.   Given a Turing Machine, does the machine acceptat least two strings from {0,1}*

d.   Given a Turing Machine, does the machine acceptat least one string of length o from {0,1}*

e.   Given a Turing Machine, does the machine acceptat most one string of length