Return to the improving search problem of Exercise 15-11.

(a) Show that the solutions x112 = 10, 0, 1, 02 and x122 = 10, 0, 0, 12 are eligible to belong to a genetic algorithm population for the problem.

(b) Construct all possible crossover results

(all cut points) for the x112 and x122 of part (a).

(c) Determine whether all your resulting solutions in part

(b) are feasible, and if not, explain what difficulty this presents for effective application of genetic algorithm search.