_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.
option C :- It is NP .
NP class deals with problems which can be solved in non deterministic polynomial algorithm.
Ref: https://en.wikipedia.org/wiki/NP_(complexity)
GATE Overflow
