3. Draw a Finite State Machine whose first two outputs are 11, then outputs 001 001 001... (without the spaces for any infinite input string.....(0) The input alphabet is {0, 1}. E.g. For any infinite string, the output would be 11 001 001 001... (without the spaces).