Draw/Sketch a finite state machine for this.

Question #4 - Finite-state machines Sketch a nite state machine (F SM) that accepts an input string if and only if that input string has an odd number of Os m at least two ls. That is, input strings should be accepted if their total number of Us is odd and there are two or more Is somewhere in the string. Here are examples of strings and an explanation for each: 01 is not accepted, because it has toofew 1s 111 is not accepted, because it has an even # of 0s (0 is an even #) 1010 is not accepted, because it has an even # of 0s (2 is an even #) 010 is not accepted, because it fails both of its conditions! 101 is accepted, because it has an odd # of Us and twoormore 1s 101010 is accepted, because it has an odd # of 0s and twoormore Is For this question, most of the points are available for any correct FSM. (Five points are for machines with near-or-at the minimum-possible number of states.) However many states you use, be careful with your layout so that the structure of your nite state machine is clear