A
A.There is no $rho$-approximation algorithm for $X$ for any $rho < 3$.
B
B.Problem $X$ is NP-hard.
C
C.The algorithm can give a solution for any instance of problem $X$ within ratio 3 of true optimum.
D
D.Problem $X$ can be solved in polynomial time.
