Urgent Requirement Given the above languages: (a) Use the set operators ‘union' and 'complement to describe L5 = L; n L2. (b) Prove that L; is regular. (c) Construct an NFA M that accepts L5, and...

Urgent Requirement

Given the above languages:

(a) Use the set operators ‘union' and 'complement to describe L5 = L; n L2.

(b) Prove that L; is regular.

(c) Construct an NFA M that accepts L5, and prove its correctness.

(d) Convert such NFA (from question above) to a DFA using the algorithm from class.

(e) Given the DFA you’ve designed in Q3(d), what is 5(s, au), for u € *. What is G(s, buaa), for U e I*. Justify your answers. Note that s is the starting state of the given DFA.