$(10$ points$)$ Consider a Traveling Salesman Problem with $5$ cities. You start solving this TSP bya branch and cut algorithm using initially just the assignment type constraints. Say, the optimal solution has the following $2$ subtours. Find a subtour elimination constraint which will eliminate this particular solution.