1. Let L be the language accepted by the FA 90 93 a a b 91 b b b 92 942 a Give a minimal FA that accepts L. Use the construction given in class (and in our reference book) that takes an FA and produces a minimal FA that accepts the same language. In your answer, give the table that is produced by the algorithm. Label the states of your FA as this algorithm does.