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

Q6. Construct an FSM that accepts all binary strings with a 1 in every even position in the string (starting from the right, you may assume that the first letter is at position 1).

26. Construct an FSM that accepts all binary strings with a 1 in every even position in the string (starting from the right, you may assume that the first letter is at position 1 )