Question 1 (1 point) What is true about a finite automaton representation? multiple starting states are not allowed the alphabet can be infinite the current state must change to a new state after a transition all transitions must have final states multiple accepting states are not allowed Question 2 (1 point Which one of the following is a list of a typical compiler components? lexical analyzer, syntak analyzet, semantic analyzer preprocessor lexical analyzer. syntax analyzer lexical analyzer, syntax analyzer, foader/linkeditor preprocessor, scanner, semantic analyzer lexical analyzer, parset, assembler Question 3 (1 point) Which one of the following compiler phases is not a part of the compiler front end? error handler semantic analyzer code generator lexical analyzer syntax analyzer