Computational issues have been sorted in feasible, to some extent resolvable and unsolvable. Classes including P, NP, NP-complete and NP-Hard are utilized to group the given issue in light of intricacy of the issue. As of ...