Consider the following Regular Expression:

a(bb)*bc

Draw a DFA for the above RE.

Determine the language accepted by this automaton

Implement this DFA in C/C++/Java.

Your implementation should validate the input string for alphabet i.e. ∑ = {a, b, c}, before using it in the DFA.

Your first implementation of DFA should use goto statements only.

Your second implementation of DFA should use switch statement instead of the goto’s.

Test your implementation using the following inputs:

abc, abbc, abcd, abbbc, abbbbc

solve all parts and steps c++ code also