Write DFAs/reg exps to accept with alphabet {a,b,c) 1: Strings that start with a 2: strings that contain substring "abc" 3. strings with an even number of a's 4. strings that do not contain substring "abc" 5. Strict definition? Exactly one move from each state on each symbol OR no more than one move from each state on each symbol? We will allow either