Question 2:

(a) Given a TG, called TG1, that accepts the language L1 and a TG, called TG2, that accepts the language L2,

show how to build a new TG (called TG3) that accepts exactly the language L1L2.

(b) Let the language L be accepted by the transition graph T and let L not contain the word .

Show how to build a new TG that accepts exactly all the words in L and the word .

Please show step by step commentary in order for me to learn