Question

For each of the following languages, give two strings that are members and two strings that are not members—a total of four strings for each part. Assume the $\mathrm{\Sigma }=\left\{\mathrm{a},\mathrm{b}\right\}$alpha-alphabet in all parts.

$$\begin{gathered} a.a*b* \\ b.a\left(ba\right)*b \\ c.a*\cup b* \\ d.\left(aaa\right)* \\ e.\Sigma *a\Sigma *b\Sigma *a\Sigma * \\ f.aba\cup bab \\ g.(\epsilon \cup a)b \\ h.(a\cup ba\cup bb)\Sigma * \end{gathered}$$

Short answer

The solution is,

Step-by-step solution

To Concern the Two Strings

There are two strings which are concerned with members, and some of the two strings are concerned with non-members. In the question, there are some calculations we have to solve, and they're related to the step-2 answer also.

To Explain the Given Expression

The image is given below: