Consider a complete undirected weighted graph G with n nodes. Let S be

the set of all the possible solutions to the travelling salesperson problem

such that every solution starts from a vertex v$1,$ and visits the vertex vx

prior to visiting vy $?$ What is $|$S$|?$ Justify your answer.