1. Consider the language of all words over {0,1} that either begin or end (or both) with 01. (a) Build a DFA accepting the language. (b) Build an NFA accepting the language. The NFA cannot be a DFA, and must use nondeterminism somehow. 2. Consider the following DFA M = (,,8,90,F) with = {a,b,c,d}, Q = {90,91,92}, F = {qo}, and 8(90, a) = 21,8(90, d) = 40, 8(91,b) = 92, 8(92, c) = 4o. (a) Draw a transition diagram for M. (b) Provide a language description for the language accepted by M. (c) Prove that L(M) is equal to the language you obtained in part b