Part b:

Create a DFA M, such that: (a) M accepts all strings which begin with b but do not contain the substring bab. (b) L(M)={aibjcki+j+k is odd },={a,b,c} Create an NFA which accepts all strings in which the third last character is an a. Then via subset construction, create an equivalent DFA. Show all your work