Please help with Exercise 2, draw automata problem follow transition table

Draw the automaton N = ({S0, S1, S2, S3, S4}, {0, 1}, delta, S0, {SI, S3} where delta is defined by the state the transition table: For each language definition, build the NFA on {0, 1} that recognize the language and its corresponding DFA. - {w| w ends with 00} (3 states)