Hey guys! I've been doing my Extended Essay about the Traveling Salesman Problem, but now I realize I'm not sure about my Research Question, and by the way, not even the subject (Math or Computer Science). I wonder if you could give me some feedback on it. My actual research question is: Proving the Traveling Salesman Problem is an NP-Complete problem. I'm thinking about maybe changing it to see how a specific algorithm (the simplex one, by Dantzig) actually helped to solve large instances of the TSP. Help, please, I'm lost. Thank you in advance!