$20.$ For the statements below, $2\mathrm{.}5$

I. A problem in the class P can be solved in worst$-$case by a polynomial time algorithm.

II$.$ A problem in the class NP can be solved by a non$-$polynomial time algorithms

III. A problem in the class NP can be verified in polynomial time

IV$.$ Finding minimum spanning tree $($MST$)$ in a weighted undirected graph is an P

Problem

V$.0/1$ Knapsack problem is an NP$-$Complete Problem

Which one of the following is correct?

$[$ A $]$ I, IV and V are true, II and III are false

$[$ B $]$ I, II$,$ IV and V are true but III is false

$[$ C $]$ I and II are false but III, IV and V are true

$[$ D $]$ II$,$ IV and V are true but I and III is false

$[$ E $]$ None of the above