For each of the following languages over the alphabet = {a, b, c} specified by the regular expressions (a)(c), provide two strings in

For each of the following languages over the alphabet Σ = {a, b, c} specified by the regular expressions (a)–(c), provide two strings in Σ∗ that are members and two strings in Σ∗ that are not members of the language (four strings each). (a) ab + a (b) ((bc) ∗ + b)a (c) (a + ab + abc) ∗ (b + c)