Question

Construct a regular expression (RE) defining each of the following languages

over the alp nohabet Σ={a,b}

a) All strings with exactly two a’s.

b) All strings that have at most one ‘a’ and at most one ‘b’.

c) All strings that do not starts and ends with the same letter​

Answer 1

Answer:

sorry I didn't know the answer sorry