show step by step solution.

must be typed.

Problem 2 In class we define the operation o which concatenates two strings. We can generalize this operation to langunges as follows: given two language Land L2, we define L2 = {uo Wlvel, and we Ly} i.e, we create all the possible strings that can be expressed as concatenation of one string from L, and one from Ls. For example, if L1 - {abc, aaa) and L2 = {caaaa), then LL2 = {abc, aaa, abcaaaa aaaaaaa). Let L be the language L = {edd, dc), M = {aca, ab), and N = {a,b). Write down all the elements of the following languages: .LOM LOMU (LON) MUN LO (MUN) (LOM)N . Lo ( MN)