# A template file for your solution.

# You are not allowed to use python libraries.

# Make sure to give good comments that explain your solution.

# You must define:

# a DFA that accepts strings containing an even number of $1$s;

# a DFA that accepts strings that contain the substring $"1010"$; and

# a DFA that accepts strings that contain at least three $0\text{'}$s$,$ at least three $1\text{'}$s$,$

and end with $\text{'}0011\text{'}.$

# You can use maps to encode DFAs.

# Here is an example DFA:

# dfa

# 'start': $\text{'}$A$\text{'},$

# 'accept': $\{\text{'}$C$\text{'}\},$

# 'transition': $\{$

# $\text{'}$A$\text{'}$: $\{\text{'}0\text{'}$: $\text{'}$B$\text{'},\text{'}1\text{'}$: $\text{'}$C$\text{'}\},$

# $\text{'}$B$\text{'}$: $\{\text{'}0\text{'}$: $\text{'}$A$\text{'},\text{'}1\text{'}$: $\text{'}$C$\text{'}\},$

# $\text{'}$C$\text{'}$: $\{\text{'}0\text{'}$: $\text{'}$B$\text{'},\text{'}1\text{'}$: $\text{'}$A$\text{'}\}$

# $\}$

# $\}$

# you need a function that runs a DFA on an input string:

def check$\_$acceptance$($dfa$,$ string$)$:

return True

## the following are the required functions that implement each DFA

## use the

def fa$1($string$)$:

return True

def fa$2($string$)$:

return True

def fa$3($string$)$:

return True