_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.

• A. NP
• B. P
• C. Hard
• D. Complete