1. [20 points) Formulate a genetic algorithm solution for the following problem. Given a set of positive integers X {x1,x2,..., we need to locate a subset S from the set X such that the sum of the elements of S is equal to the golden number 21. For instance, if the set X = (12.17.3,24,6). the set S = {12, 3.6) is a valid solution. You may use binary representation, OR any representation that you think is more appropriate. you should specify: . An objective/fitness function. Give 3 individuals and their fitness values if you are solving the following problem (i.e. X = 12, 17, 3,24,6). Operators of Genetic Algorithms including reproduction, crossover and mutation. Try to modify the operators to the problem if possible. A termination condition for the genetic algorithm