Question: construct a fa for the language of all strings where...
Construct a FA for the language of all strings where characters in odd numbered positions (i.e. the 1st, 3rd, 5th, etc.) must be the letter "a" and convert the FA into a regular expression.
NOTE: The empty string does satisfy the requirement.
Please show steps if possible!