1. Regular Expressions and Deterministic Automata: a. (10 Points) Write a regular expression to recognize strings have any number of characters in (alblc, but there must be a multiple of 3 occurrences of c Positive examples: String Comment The simplest string in the language No c's in the string is okay 3 e's is okay too 6 c's is okay too abba cCC Has 3 c's acbcacbbaccabac Has 6 c's acbcacbba Negative examples: abeHas only 1 c,not a multiple of 3 cabe Has only 2 c's, not a multiple of 3 cbacc Has 4 c's, not a multiple of 3 b. (10 Points) Write a Deterministic Finite Automaton that can recognize the language above