Q$5$: Consider that we have a Vacuum$-$cleaner machine robot that can move left, right, up$,$ down only, and it does the suck if the square is dirty, the Vacuum$-$cleaner robot never back to visited square. Goal Build a complete Search tree $-$ Solve the search problem by using Greedy search algorithm if the heuristic function is Manhattan distance Q$6$: 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 b$1$b$2$b$3$b$4$b$5.$ The fitness function is defined: