Consider the NFA with epsilon transitions that accepts the language {0n1m2l|n,m,l>0}. Transform it to an equivalent DFA. Don't consider inaccessible states and draw the diagram of transitions.