please actually draw the NFA

5. Construct NFAs with the specified number of states for each of the following languages, where ={0,1} a. { w : w ends with 00} in three states. 2 points b. {w:w contains the substring 0101} with five states. 2 points c. {w : w contains an even number of 0 's or exactly two 1 's\} with six states. 2 points