Generate a regular expression for the language over the 3-letter alphabet {a,b,c}:

L = { w {a,b,c}* : w does not contain the substring cb }

Follow this procedure:

a. Create a DFA for the complement language, L' = {a,b,c}* L, i.e., strings which contain "cb".

b. Complement the DFA for L' in (a), creating a DFA for L.

c. Modify the DFA in (b), into a "special" NFA (i.e., start state is outgoing-only, one final state which is incoming-only).

d. Using the NFA in (c), generate a regular expression by interior node elimination.

e. Simplify. The final answer should be realized as a regular expression string of length 10 (counting all characters) without using any of the syntactic extensions ?, +, {..}.