The language for the given regular expression (RE) is as follows −
Let the regular expression be ((a+b)(a+b))*(a+b).
Construct the Finite automata for the given regular expression.
First, generate the language for the given Regular Expression −
This is the language of odd length strings
The Finite Automata is as follows −