Develop a simple genetic algorithm that minimizes the function f(x,x) = 100 x (x-x) + (1-x). 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 1023. a) Identify the phenotype and genotype. b) Describe one-point crossover for chosen chromosome representation. Then describe the bit-mutation. Write a pseudo-code of the simple genetic algorithm. Pa 7 d) Explain how the genetic algorithm will be changed if elitism is used.