this problems represents Travels sales man, Using Genetic Algorithms, you have a population of size 4, answer the following questions: E F H 4 7 B A0 | 10 | 11 0 2 0 D 9 2 1 0 G 5 5 8 10 6 4 3 3 6 3 2 TOULOI E 0 2 4 3 1 1 0 5 3 3 2 0 0 x1: E G C D F B H A X2: EF HAC DB G X3: EA F D G B C H x4: E B G F A H C D a. Compute the fitness values and sort in decreasing order. The fitness function is f(x) = 100 - totalDistance (the distance between cities are given in the table.) b. Select the two fittest individuals to perform Partially Mapped Cross-over (PMX) c. Use a window size of 4 to apply inversion and reciprocal Exchange mutations on the new individuals created after the cross-over. d. List the stops of the optimal path and indicate the total distance of this path