Answer:A

133 views

## 1 Answer

0 votes

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)

133 views

0 votes

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)

Search GATE Overflow for GATE CSE