Question & Answer: For alphabet {0, 1}, all strings of length 3 or less that have more 0's than 1's…..

For alphabet {0, 1}, all strings of length 3 or less that have more 0’s than 1’s

(1) Write a regular expression for the language.

(2) Define a finite state machine (FSM) that recognizes words in the language (input alphabet, states, start state, state transition table, and accept states). Include a state digraph for the FSM.