CSCI 4560/6560 Evolutionary Computation Assignment Number 1: Due 9/17/2020 (in class) 1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive integers X = {1,2,...2n}. 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 subsetz problem in this example. Formulate the subsetz 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. A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subsetzi problem if possible without run- ning indefinitely