a$)$ Define what is meant by a language being NP$-$intermediate. b$)$ Define the

formal language Prime factorization. c$)$ What do we know about the relation

of PRIme FACtORIzATION and the language classes $P$ and the class of NP$-$complete

languages?

a$)$ Define space complexity classes SPACE$(f(n)),$NSPACE$(f(n)),$ L$.$ b$)$ Define

the language Reachability. c$)$ State the theorem we have learnt on its space

complexity.