(15 Points) Construct a DFA/NFA that accepts the language L defined over the alphabet = {a, b, C, ..., y, z} as follows: L = {state, regular}