Vertex A B C D E F G H 16 4 known T T T T T T T 10 18 d. 7 0 15 19 41 11 12 20 P G H C M J 6 2 B 10 K 10

Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual x be calculated as: f(x) = (a + b) – (c + d) + (e + f) – (g + h) and let the initial population consist of four individuals with the following chromosomes: x1 = 6 5 4 13 5 32 x2 = 87 126601 x3 = 2392 1 285 x4 = 4185 2094 1. Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest fiırst and the least fit last. 2. Perform the following crossover operations: One-point crossover, Two-point crossover, and uniform crossover.

n-1 Geometric (n) = i=1 i=1 1 1 * n-1 П %3D Harmonic (n) = i=1 n Let's look at examples. If we use n = 4, the geometric progression would be 1 * 2 * 3 * 4 = 24, and the harmonic 1.1.1 1 progression would be 1* -= 0.04166. 2 3 4 24 Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println ("Method call -- " + "calculating " "Factorial of: " + n); + Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return (factorial (n - 1) * n); c. Add these lines in the recursive section: temp = factorial (n - 1); System.out.println ("Factorial of: " (n - 1) + " is " temp); return (temp * n); 3. Rerun the program and note how the recursive calls…