The following state transition table defines a FSA on the alphabet $\{0,1\}.$

$01$

$->$ A B C

B F D

C E D

D E B $$

E D F $$

F B E

Find the minimized FSA, written in standard form, which accepts the same language.