Explain the following with examples i) P problem ii) NP Problem iii) NP- Complete problem iv) NP – Hard Problems
i) P Problems Class P is the set of decision problems that can be solved in polynomial time by a deterministic algorithm. That means the algorithm’s time complexity is in…
