Consider the language L given below over Σ = a, b, c. L = All strings starting…

Consider the language L given below over Σ = a, b, c.

L = All strings starting with ‘a’ has odd length or all strings starting with ‘b’ has even length.

The minimum number of states in the DFA accepting the language