Hello I have a Automata homework could yoou help me?

For each of the following languages, prove that the language is regular by giving a finite automaton (DFA or NFA) recognizing it. You need to adequately argue that your automaton is indeed recognizing the given language.

15 Pointsl The set of all srings over (0, 1) that contain either an even number of os or the nur ohenthetig thmumber doses not at most three 0s (that is, if the number of Os is even, the string is in the language, but if exceed 3)