Hi, can someone answer this question?

******************************************************************************************************************************************************************

When you are answering it, please MAKE SURE TO DO ALL OF THE FOLLOWING:

1) Come up with a DFA that uses 4 states exactly

2) Remove a middle state to get a 3 state graph

3) Remove another middle state to get a 2 state graph

4) Finally, come up with a regular expression to fulfill the original language

Please show every step- thank you!!

15. Find a regular expression for the following languages on la, b (a) L - fw : na (w) and n, (w) are both od