Constructing Noneterministic Finite Automata (NFA) with a "not" condition
First construct the DFA which accepts any string that DOES contain "abaa".  Then interchange final vs non-final!  (note: this only works with a DFA, not an NFA)  The rest you have already figured out.