3. (1 pt) Build a TG that accepts the words that have even occurrences of the substring ab. 4. (0.5 pt) Construct the transition and output table for the following Moore machine ab Our 90 ab 5. (0.5 t) Construct the transition and output table for the following Mealy machine b/1 obro D 6. (1 pt) Construct the Mealy machine's transition table that is equivalent to following sequential circuit input Extra Credit: (1 pt) Given a TG called TG, that accepts language Li, another TG2 that accepts a language L2 and another TG3 that accepts a language L3, show how can we build another TG that accepts L.L2 + L3, which means a word from L, concatenated with a word from L2 or a word from L3