Using Genetic algorithms solve the Traveling Salesman Problem who should visit all the point in the figure. He should start from and end in point A. Consider the following: 1- In the figure each line carries the distance between the two connected points. 2- We need to minimize the distance that will be traveled daily by the salesman. 3- Start with population size 3. 4- Consider the Elitism phenomena. Run the algorithm for 2 generations and return the best solution