Build deterministic finite automata forthe following language.

The set of all strings that have exactly one doubled digit in them.

In other words, either 11 or 00 occurs in the string, but not both,

and it only occurs once.