What is the language recognised by a nondeterministic Turing machine N$?$

The following multiple$-$choice options contain math elements, so you may need to read them in your screen reader's $$reading$$ or $$browse$$ mode instead of $$forms$$ or $$focus$$ mode.

Choice $1$ of $4$:The set of strings u such that no branch of the computation tree of u contains a rejecting configuration.

Choice $2$ of $4$:The set of strings u such that every branch of the computation tree of u contains an accepting configuration.

Choice $3$ of $4$:The set of strings u such that some branch of the computation tree of u contains an accepting configuration.

Choice $4$ of $4$:The set of strings u such that no branch of the computation tree of u is infinite.