Now imagine that you wish to run a Genetic Algorithm on Part a's search space. You use four bits to represent nodes: A = 0001, B = 0010, C =0 011, D = 0100, E = 0101, F =0 110, G1 =1 001, G2 = 1110, J = 0111, and S = 0000.
i. If nodes B and E are chosen for the cross-over operator, show two possible children that can be produced.
ii. With 4 bits one can represent 16 distinct nodes, but only 10 are in this task's search problem. What do you think should be done when a bit string is generated that matches none of the nodes?