Given a TG called TG1 that accepts language L1, another TG2 that accepts a language L2, and another TG3 that accepts a language L3, show how can we build another TG that accepts L1.L2 + L3, which means a word from L1 concatenated with a word from L2 or a word from L3