Hi, please help with the problem that is highlighted in yellow. Only answer this question if you know how to do it, Thanks.

Exercise 2 (3 points): Sketch a NFA with the specified number of states for each of the following languages. In each case the alphabet is 2-(0,1). a) (w: w ends in 01) with three states. b) w: w contains the substring 0110 with five states. c) (w: w contains an odd number of ones or exactly two Os) Show your work. [1 point] [1 point] point]