Assume p not equal to np
1- it's known that the general traveling salesman problem is np-hard use this fact to show that the taveling salesman problem with the triangle inequality property is still np hard

2- is the approximation traveling salesman problem with the triangle inequality np hard for every approximation ratio ( just state the result)

3- is the approximation general traveling salesman problem np hard for every approximation ratio ( prove it in details)