a. Show that the following problem is undecidable: Given a Turing Machine M and input w, determine if M revisits the starting cell on the tape during the computation.

b. Show that the following problem is undecidable: Given a Turing Machine M and input w, determine if M uses a finite amount of tape during the computation. and Given a Turing Machine M determine if L(M) contains any strings of even length.