Consider the magic square problem to solve using evolutionary algorithms. In this case, there is a table with dimensions of 3*3 that the numbers 1 to 15 should be placed in the cells of this table so that the following conditions are always met : i) Each number is allowed to be used and registered in the table only once. ii) The sum of the numbers in all rows of the table must be the same and equal to 24. iii) The sum of the numbers in all the columns of the table must be the same and equal to 24. Provide a genetic algorithms to solve this problem, in the form of the following questions : A) Determine the structure of chromosomes and how to map the genes of each chromosome in the magic square problem? B) Determine the effective parameters in the fitness function of the magic square problem and propose its fitness function? C) Write the MATLAB code for randomly generating an initial population of chromosomes (n chromosomes) in this magic square p