please show all your work ;)

Thank you

CSE 303: INTRODUCTION TO THE THEORY OF COMPUTATION Assignment 5. Due next Friday 1. You are to determine whether each of the following languages is context-free or not. If you claim that inc auguage is context-free, then provide a PDA to recognize it. Otherwise, use the Pumping Lemma to show that it is not context-free. (a) (o 102m 103nn o) (c) {a'Vtk=min(i, j)} 2. Give Turing Machines for the following languages. (a) wjw contains twice as many Os as 1s) (b) (wwRlw E (a, b) and wR is the "reverse" of w) Include short comments to explain the machine's moves comments of the form "the read/urite head is moved along the tape until ...". (Consider my explanation in class of the Turing Machine for (0t 1 n 2 01.) Where possible and appropriate, give comments for groups of 6-moves instead of for individual moves