Give a DFA or NFA


Give a DFA or NFA to accept the following language B.
B = {w | w ∈ {a, b}*and w includes an a but not as its third character}.
You must show vertex descriptors; be sure to make them precise


is there a condition that w must include a… or it may or may not… And what about the minimum length of the string then is it 3 or 0? please elaborate the question a bit.