NP-Hard: If every problem in NP can be polynomial time reducible to a problem 'A', then 'A' is called NP-Hard. If  'A' could be solved in polynomial time then every problem in NP…