Answer
See the explanation
Work Step by Step
In computational theory, a problem is tractable if it can be solved in polynomial time — meaning the time required to solve it grows reasonably with the size of the input.
Tractable problems are considered efficiently solvable.
No, the given problem would not be considered tractable. Tractability typically refers to the feasibility of solving a problem within a reasonable amount of time, typically polynomial time. If the best algorithm for a problem would require 100 years to execute, it indicates that the problem is not tractable within practical constraints.
