Given DFA's accepting the following languages over the alphabet bet { 0 ,1 } Why is it that there are 2 accepting states? Doesnt this violate the rule of DFA? Wouldnt this make it a NFA since there are 2 accepting states?

c) Set of strings that either begin or end (or both) with 01 A first path starting with 01 and then ending in sigma(covers the case which both being and end), and then the strings that do not start with 01 must end with 0 D, 1