Please justify

PROBLEM 4 (10%) Let L1, L2, L3 be regular languages over an alphabet 2. Suppose we are given DFAs M1, M2, M3 such that L(M) = L; for i = 1,2,3. Question a: Describe in your own words how you can use the DFA's above to construct algorithms for answering the following questions: (1) Is L1 L2 = 0? (2) Is L3 = LI UL2? (3) Is LULU L3 # *? (4) Is Lin L2 L3? Question b: Can we still make such algorithms if M is just an NFA for each i = 1, 2, 3