You may use the pictorial representation of the FSM for the questions below. Do explain the inner workings of each of the machines below.

Q5. Construct a FSM that accepts all strings over alphabet {a, b, c} all those strings that an odd number of as.

5. Construct a FSM that accepts all strings over alphabet {a,b,c} all those strings that an odd number of a s. 6. Construct an FSM that accepts all binary strings with a 1 in every even