I'm stuck on this: formal language and automata

Convert the nfa defined by delta (q_0, a) = {q_0, q_1} delta(q_1, b) = {q_1, q_2} delta(q_2, a) = {q_2} delta (q_0, lambda) = {q_2} with initial state go and final state q_2 into an equivalent dfa