Question

Let A = {w : w is a binary string containing an odd number of 1s}. We claim that this language A is
regular. In order to prove this, to construct a finite automaton M such that A = L(M).

Answer 1

Answer:

BRAINLY BRANLY BRANLY BRAINLY