Given the following map, use the wave front algorithm and gradient descent to find the trajectory that a robot that is at the initial point $5$ must follow to reach the desired point $g$ considering a connectivity of $4.$

Initialize with the following values:

Free snace: $0($just as reference$),$ Obstacles: $1,$ Desired point: $2$

$($drow plese$)$