Write a regular expression for the following languages: Let X = {a^i | i > 0}, V = I j > 0} and Z = {c^k | k > 0} be two languages over What is the concatenated language XZY? List all the sentences (strings) of length 5 from XZY aba is not a substring w} each a in w is immediately followed by at least two b's }