Mathematics Homework Help

1. write the English description of a TM for the following language: {w| w is composed of a’s and b’s, and the addition of the number of a’s and the number of b’s is even}

2. Let L ⸦ {0, 1}* be the language {(M, x) | Turing Machine M on input x enters every state of M at least once}. Show that membership in L is undecidable.