1. [20 points][MID] The subseta problem is stated as follows. Given a set of N positive integers X {z1,72, ...,}. Find a subset P of the set X such that the sum of the elements of P is equal to 21....

Extracted text: 1. [20 points][MID] The subseta problem is stated as follows. Given a set of N positive integers X {z1,72, ...,}. Find a subset P of the set X such that the sum of the elements of P is equal to 21. For example, if N=5 and the set X = {12, 17, 3, 24, 6}, the set P= {12,3, 6} is a valid solution for the subseta problem in this example. Formulate the subsety problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example (i.e. X = {12, 17, 3, 24, 6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subseta problem if possible without run- ning indefinitely.