Consider a GA is used to solve the traveling salesman problem $($TSP$)$ aiming to find the best route for visiting the cities $1,2,3,$ and $4$ starting from the home city $0$ and returning back at the end to city $0.$ The distances between the cities and the initial population are as follows:

$\backslash$table$[[$Distances$],[$City$,1,2,3,4],[0,15,20,8,13],[1,,10,20,14],[2,,,7,5],[3,,,,9]]$

$\backslash$table$[[$The initial population,$],[$ndividual I,$0,2,3,4,1,],[$ndividual $2,0,1,2,3,4,],[$ndividual $3,0,4,1,3,2,],[$ndividual $4,0,3,1,2,4,]]$

Determine the best route according to the following: $($i$)$ Sort the individuals from the best fitness $($best route$)$ to the worst one. $($ii$)$ Select the I"t parent from best and the worst individuals, and the $2^{nd}$ parent from the remaining two individuals. $($iii$)$ Generate a new offspring using two$-$point erossover between $2$ and $4$ for both of the two pairs. $($iv$)$ Calculate the fitness of the new generation. $($v$)$ Select the new population using the weak parent replacement technique.