For each of the following multiple$-$answer multiple choice question, select all correct options.

While justification is not required to received for full credit, providing it is highly encouraged.

Note: If you are editing the LATEX f Suppose $($c$)$ P $=$ NP$,$ which of the following statement$($s$)$ is$/$are true?

$$ NP$-$Complete languages cannot be decided efficiently.

$$ If L is NP$-$Hard, then L $$ in P$.$

$$ If L is NP$-$Hard, then L is not in P$.$

$$ Every language in the class NP is also NP$-$Hard.

$$ Lodd $=\{$n : n is odd$\}$ is not NP$-$Complete.