Proof must be done by mutual induction.

Let L={w{0,1}:w has an odd no. of 1 's }, and let A be the DFA with tabular representation: Prove that L=L(A). Hint: Do the L(A)L part of the proof by induction on the the length of the string processed by A. You need a mutual induction with a claim for state p and a claim for state