$27$

Multiple Answer $2$ points

Which of the following describe the brute force solution of the PATH problem? $($Select all correct answers$)$

Takes polynomial time on a nondeterministic turing machine

Takes longer than polynomial time on a modern computer

Proves the problem is NP$-$Complete

Proves that the problem cannot be in $P$

$35$ Multiple Answer $3$ points

Select all categories the following language falls into:

$L=\{0^n{1}^m|n3,m1\}$

Finite Language

Regular Language

Context$-$Free Language

Turing Recognizable