You are given an NP$-$Hard minimization problem PROBLEM $($PROBLEM can be for example General TSP$),$ and for any instance I, the solution of PROBLEM on I is either exactly $$ or $>$ c$*$mu where c $>1$ is a constant, and u is a parameter that depends on I. Then, there is no polynomial time c$-$approximation algorithm for PROBLEM because: