In problem2.jff, build a deterministic finite-state machine that accepts all bit strings in which the first and last bits are the same, and that rejects all other bit strings. it should notaccept the empty string.

this problem requires at least five states. you may use more states if necessary (there’s no penalty for doing so), but if you have time, try to get as close to the minimum as possible!
here are three examples of strings that should be accepted:

01010
1
11101
here are three strings that should be rejected:
01
0010011
0