Which of the following cannot be a valid solution for a Traveling Salesman Problem $($TSP$)$ with one start$/$end node and $5$ cities to visit?

Which of the following cannot be a valid solution for a Traveling Salesman Problem $($TSP$)$ with one start$/$end node and $5$ cities to visit?

start$-1-2-3-4-5-$end

start$-5-4-3-2-1-$end

start$-2-3-4-1-$end

start$-3-2-3-1-4-$end