You may use Jflap but any dfa you submit must have no -moves, no missing moves, and no multiple moves (on the same input symbol). Show all your work to receive partial credit.

Given the regular expression r= ( cd +b )*, draw a dfa M over { = { a, b, c, d } such that L(M)=L(r). Make sure that your dfa has exactly 4 transitions (1 for each input symbol) out of each state