It is proven that sorting algorithm can be reduced to Problem X, and Problem X can be reduced to Traveling Salesman Problem (TSP). All reduction can be done in linear time (O(n)). For each of the following, indicate True, False, or Unknown. Sralama algoritmasnn Problem xe, Problem X'in Gezgin Satc Problemine (TSP) indirgenebilecei kantlanmtr. Tm indirgeme dorusal zamanda (O(n)) yaplabilir. Aadakilerin her biri iin Doru, Yanl veya Bilinmiyor olarak belirtin. a) Problem X can be reduced to Knapsack Problem in polynomial time. Problem X polinom zamannda Srt antas Problemine indirgenebilir. b) Problem X is NP-complete. Problem X NP-tamdr. c) Problem X may be solved by an algorithm with linear time complexity. Problem X, lineer zaman karmaklna sahip bir algoritma ile zlebilir. a) Seo c) Se... . . . b) Seo