Construct the NFA for a langauge.

Construct the NFA for a language L = {set of all strings over (a,b) that starts with 'aa' and ends with 'ab'}. Convert it to its equivalent DFA. Write state set, start state, final state(s), and transition table