please answer the question on a piece of paper Draw a state diagram of an NFA that recognizes the language over the alphabet $\{0,1\}$

consisting of all strings that start with $01$ or $10.$