Consider in an evolutionary algorithm, it is possible to use only the single or multi point crossover reproductions on an initial population of zeros and ones (0,1) and not to use the mutation operation. therefore, we will never get the optimal answer. Demonstrate this problem using the initial population as shown below? 1 0 1 0 0 0 1 0 1 1 0 1 1 1 1 1 0 1 0 1 0 1 1 o 1 0 1 1 1 0 0