Local Genetic Algorithm to find four start positions in python code for below scenarios For any arbitrary node n the heuristic to reach the Heart h(n) is given by the below: Manhattan distance + Color Penalty where, Color Penalty = +5 if the node n and goal node is in different colored room and Color Penalty = -5 if the node n and goal node is in same colored room. Interpret and explain the significance of applicable hyperparameters