In the context of language hierarchy, where sub means proper subset, $*$

Recursively enumerable languages sub Context$-$free languages sub Regular languages

Regular languages sub Context$-$free languages sub Recursively enumerable languages

Regular languages sub Recursively enumerable languages sub Context$-$free languages

Context$-$free languages sub Regular languages sub Recursively enumerable languages

Extending a Turing Machine to be non$-$deterministic makes it: $*$

None of the mentioned

More powerful than a basic$/$standard Turing Machine

Less powerful than a basic$/$standard Turing Machine

The same power as a basic$/$standard Turing Machine