In the traveling salesperson model, assume n is the number of customers to be served, dy is the distance between city "i and "j, customer 1 is the depot, m is the number of salespeople and the...

The most appropriate solution please?

Extracted text: In the traveling salesperson model, assume n is the number of customers to be served, dy is the distance between city "i and "j, customer 1 is the depot, m is the number of salespeople and the decision variables are x, and u Answer the following question The sub-tour elimination constraint of degree two is: a. None of the mentioned Ob. x +x 2 1 for i, je (2.n) and ij c. E SI for je (2.n) and i j Od. xy + x S I for i,je (2.n) and i j e. Edy = 00.for i j