Step 0: (i)r is an alphabet,called the input alphabet ofU, (ii)So is an alphabet,called the output alphabet of U Step 1: (iii)Li is the language of feasible problem instances, (iv)LIL is the language of the (actual)problem instances of U, 问题10：L和L的区别是什么？ Traveling Salesperson Problem (TSP) Input:A weighted complete graph (G,c),where G=(V,E)and c:E IN.Let V={v1,...,Un}for some n E IN -10}. Constraints:For every input instance (G,c),M(G,c)={vi,viz,...,vin, vi(1,i2,...,in)is a permutation of (1,2,...,n)}.i.e.,the set of all Hamiltonian cycles of G. Costs: For every Hamiltonian cycle H=v...vEM(G,c), c0st(,2,n,),(G,c》=∑c（u,um24w+}》. i.e.,the cost of every Hamiltonian cycle I is the sum of the weights of all edges of H. Goal: minimum.Step 0: Step 1: 问题10：L和LI的区别是什么？