1. (8 points) For two languages L1 and L2, denote their concatenation L1L2 as the set of strings obtained by concatenating strings from each of the languages: LL2 = {ry | x E L1, y E L2}. Prove (via a formal proof using set-theoretic axioms) or disprove (via a counter-example) that: (a) (4 points) If L1, L2, L3 are languages, and L2 C L3 then L1L2 C LL3. (b) (4 points) If L1, L2 and L3 are languages, then L1 (L2 N L3) = L1 L2n L,L3