Here are some of the problems on my grammar homework that I'm having some trouble with. The directions are written below.

Draw an FSA diagram (either DFA [Deterministic Finite States] or NFA [Non-Deterministic Finite State]) for each of the following regular languages.

(A) a∗

(B) aa∗

(C) (aa) ∗

(D){pat; pot; pet; pit; put; pond; poll; pork}

(E) 1(0I1) ∗

Here are some of the answers that I've come up with:HW 4 Problems A - E.pdf