Just need help on part 3. Ignore questions 1 and 2. Thanks !

Let sigma = {a, b, c} and let L be the language over sigma given below. L = {w elementof sigma |if a appears in we then b appears in }. Observe that (i) Find a FSA A such that L(A) = L. (ii) Prove your answer to the previous part is correct. (iii) Find a regular expression E such that L(E) = L (you need not prove your answer is correct). (i) Find an NFA N such that L(N) = ii) Prove your answer to the previous part is correct. (iii) Find a regular expression E such that L(E) = (i) Find an NFA N such that L(N) = (ii) Prove your answer to the previous part is correct. (iii) Find a regular expression E such that L(E) =