Write a program to implement a GA. The problem is quite simple: it tries to find a bit string of alternating three ones and three zeroes (e.g. 111000111000..). The string must start with three 1s and three Os should become after that. This pattern should be repeated for the whole string Run your GA with the following parameters Representation: Bitstring (L-24) Initialization: random Parent Selection: fitness proportionate, implemented via roulette wheel Recombination:
OR
OR