3. Hot L= 40 e 60.) 3. Let L = {w e {0,1}* : w has an odd no. of 1's }, and let A be the DFA with tabular represen- tation: A || 0 | 1 p || P a *q|| qp Prove that L = L(A). Hint: Do the L(A) SL 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