6. Find an NFA with four states that accepts the language L = {a": n >0} U{ba : n > 1}