: Consider a genetic algorithm in which individuals are represented using a $6-$bit string of the form $($c$1$ c$2$ c$3$ c$4$ c$5$ c$6).$ An example of an individual is $110110$ for which c$1=1,$ c$2=1,$ c$3=0,$ c$4=1,$ c$5=1,$ c$6=0.$

The fitness function is defined as follows:

fit$($c$1$ c$2$ c$3$ c$4$ c$5$ c$6)=$ c$1+$ c$2+$ c$3+$ c$4+$ c$5+$ c$6+$ OR$($c$1,$c$2,$c$3,$c$4,$c$5,$c$6),$

where OR$($c$1,$c$2,$c$3,$c$4,$c$5,$c$6)=1$ if any one of c$1$ to c$6=1$; and OR$($c$1,$c$2,$c$3,$c$4,$c$5,$c$6)=0$ otherwise.