In the Travelling Salesman Problem TSP$,$ to finding the shortest route through S cities $($Beth$.$ The left $124$: Jerusalem, Ramallah, Nablus$),$ such that each city is visited only once and in the end rethleher, Hebion we use a genetic algorithm to solve this problem if the fitness function is used according to the starting city. distance, Which parents will be selected from this generation? Write your anseng to the shortest space between like: $12$

BHJNRB

HBRJNH

RUNHBR

JBHRNJ