Need solutions to these questions. PLEASE DRAW STATE DIAGRAMS!

The regular expression (dUdb)d and let L be the language over {b,d} expressed by this r.e. a) Draw a NFA state diagram of dd. Make sure to draw the NFAs for d and for d and use both of the diagrams to construct the NFA for dd b) Give a state diagram for the simplest NFA that recognizes the language L (i.e. the language described by (dddb)d). c) Use the NFA from Part B and draw a state diagram for a DFA that recognizes L. Make sure to label the states as sets of states from your NFA