Question 4: Designing finite state machines [5 points] For each item below you must design a finite state machine which behaves as described. Every finite state machine must have input alphabet I={0,1} and, if appropriate, output alphabet O={0,1} (some finite state machine below do not produce outputs). 1. Design a finite state machine which accepts input strings whose number of ones is a multiple of three (note that zero is a multiple of three). 2. Design a finite state machine which outputs the input string. This is a representation of the identity function as a finite state machine