Draw state diagrams for the following finite automata:

(A) A DFA recognizing all strings starting with 10.

(B) An NFA recognizing all strings ending with 01.

(C) An NFA recognizing all strings starting with 10 and ending with 01.

Given the regular expressions generated the above languages over the alphabet = {0,1};