Q:Question:Develop a simple genetic algorithm that minimizes the function f(x_1, x_2)=100 ??(x_1^2-x_2)^2+(1-x_1)^2. Use a binary representation of integers. Use one-point crossover, bit-mutation and tournament selection

Q:Question:Develop a simple genetic algorithm that minimizes the function f(x_1, x_2)=100 Ã?Â?(x_1^2-x_2)^2+(1-x_1)^2. Use a binary representation of integers. Use one-point crossover, bit-mutation and tournament selection (choose the most suitable the crossover and mutation rates). Minimize f(x) in the range of 0 ? x_i? 1023. a) Identify the phenotype and genotype. b) Describe one-point crossover for chosen chromosome representation. Then describe the bit-mutation. c) Write a pseudo-code of the simple genetic algorithm. pa e 7 d) Explain how the genetic algorithm will be changed if elitism is used.