non deterministic finite automaton

4. (15 points) Construct an NFA that recognizes language L4 ={x over {a,b,c}x starts with an even number of as and ends with an odd number of bs}