Design a DFA that will recognize accept the regular expression: $($a $|\backslash$epsi $)$ a a b c $($Note that $\backslash$epsi $($epsilon$)$ means the empty string.$)$