Consider languages over a fixed alphabet with || = 2. Answer true or false to the following questions. Justify your answers, giving examples of the languages L1 and L2 where appropriate.

b) If L1 L2 and L2 is nonregular, then L1 is nonregular,

d) If L1 is regular, then L1 L2 is regular for any language L2,

e) If L1 and L2 are nonregular, then L1 L2 is nonregular.

(NEED TO PROVE ALL THREE ARE FALSE)