2. Draw the DFA for the following languages a. L = {w|w contains substring “aba" and has b in the second last position} b. L = {w[ every 3rd symbol in w is 0} e.g. 110100, 000110001. But 101 won't be...

Extracted text: 2. Draw the DFA for the following languages a. L = {w|w contains substring “aba" and has b in the second last position} b. L = {w[ every 3rd symbol in w is 0} e.g. 110100, 000110001. But 101 won't be accepted since the 3rd symbol is 1. c. Set of all strings that are at least of length 4 and contain an even number of 1's d. L = {w| The 3rd last symbol in w is 0}