In problem4.jff, build a deterministic finite-state machine that accepts all bit strings in which the the third-to-last bit is a 1, and that rejects all other bit strings. This problem is a bit tricky, and well discuss it in class, so we encourage you to consult the lecture notes.

This problem requires at least eight states. You may use more states if necessary (theres no penalty for doing so), but if you have time, try to get as close to the minimum as possible!

Here are four examples of strings that should be accepted:

0101 100 11110101000100 1101 

Here are three strings that should be rejected:

10 11111001 011011