Construct NFA accepting strings ending with '11' , '101' , '110'

Question

For the language L over the alphabet {0,1} that accepts strings ending in 11, 101, or 110, perform the following steps:

1. State the regular expression defining L.
2. Draw the transition diagram for an NFA that accepts L.
3. Derive the equivalent DFA. Present its transition table and accepting states.

I did the step 1, which the answer is (0+1)*(11+101+110). But I'm stuck on the 2nd step.