Problems that can be solved in polynomial time are called ans.linear problemssimple problemstractable problemspolynomial problems

Problems that can be solved in polynomial time are called ans.

Problems that can be solved in polynomial time are called

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________ans.

A problem is in P if:a.It is NP-Hardb.It is as hard as the hardest problems in NPc.Its solutions can be verified in polynomial timed.It can be solved in polynomial time

answerOnly problems that are recursively defined can be solved using recursion.