Tracing an NFA on a String: Following Nondeterministic Branches to Decide Acceptance

An NFA accepts a string iff at least one choice of transitions ends in an accepting state — track the whole set of reachable states symbol by symbol instead of guessing one lucky path.