Consider the problem of finding the shortest path between two nodes in a graph. Is this problem in complexity class P or NP$?$ Justify your answer.

If $3-$SAT$pL$ and $Lp3-$SAT Which of the following can be inferred from these reductions?

a$)L$ is NP$-$Hard but not NP$-$Complete

b$)L$ is in NP$,$ but it is not NP$-$Complete

c$)$ L is NP$-$Complete

d$)L$ is neither NP$-$Hard, nor in NP

Show that sorting an array of integers belongs to NP$-$class.