A. Supposed that you have this Sate Space with 2 Goals Gl and G2 Goal State Formulate this State Space as a search tree. Solve the problem using DS for the 2 goals. Solve the problem using BS for the 2 goals. Solve the problem by greedy for the 2 goals. Solve the problem by A* search for the 2 goals Start State 10 B. Consider that a system uses a genetic algorithm in one of his tasks, which individuals are represented using a 7-bit string of the form b;b;b;b,bs bb7. The fitness function is defined: (b,b,b,b,bs) = (bi + b; + b3 + b, + bs)/3 + OR(b,ba,bs) -0 .5 * XNOR(b,b-) + 0.75 Apply GAs Process on this Population (Show Work), use RW selection, 2-bit crossover and 1-bit mutation. 0111101 0110010 1011011 0000101 1111011 1111111 1010101