For each of the following languages, graphically depicta FSM that represents that languageand describeitusing the five components of an FSM. Do not forgetto provide eitherthe transition matrixor list of transition functions. a. A FSM that accepts all binary strings that have an odd number of 1's.
Examples: 1, 111, 010,010010100
b. A FSM that accepts all binary strings that contain the substring 011.
Examples: 011, 0101100, 011001, 011011011
c. A FSM that accepts all binary strings that end in 00.
Examples: 00, 1100, 010100, 1111100
d. All binary strings made up of a single byte.
Examples: 00000000, 01010101,00110011