b) Obtain the DFA that accepts/recognizes the language L(M) = {w | w {a, b, c}* and w contains the pattern abac} (Note: This is an application of DFAs involving searching a text for a specified pattern). [5 Marks] c) Determine an NFA accepting the language L1 {x|x{a,b,c}* and x contains the pattern abac} [5 Marks] d) Determine a NFA accepting {ab, ba} and use it to find a DFA accepting it.