Please solve all branches without shortage, on paper, step by step

Q6: Suppose we have this machine called Mars Rover, we want to practice all we learned. Consider that this system use a genetic algorithm in one of his tasks, which individuals are represented using a 5-bit string of the form blb2b3b4b5. The fitness function is defined: f(b1b2b3b4b5)=(b1+b2+b3+b4+b5)/2+OR(b3,b4,b5)-XNOR(b6,b7) Applied GAs Process on this Population using RW selection and 2 bit random crossover 1 bit random mutation (Show Work step by step) 0111101 0110010 1011011 I want the step-by-step solution on paper, not 0000101 code 1111011 1110111 1111111 0000001