Given a TG, called TG1, that accepts the language L1 and a TG, called TG2, that accepts the language L2, describe an algorithm that builds a new TG (called TG3) that accepts exactly the language L1 + L2. (Hint: your algorithm should work for any two input TGs.)