If δ() = ɸ (Dead State) [Dead state not allowed at DFA but allowed at NFA] that means this machine reject b.
Now ω = aab, δ(, aab)
At final we can get a set of final states, if at least one of the states is final state then NFA accept the string. So, it is an accepted string (aab).
Let ω = ab