write a code in python$($there should not be any plagiarism$)$

Consider the following grid:$($refer to the grid in the image provided$)$

You have to plan for a robot to go from start to end. The robot can only move left, right, bottom, or up$.$ Also, the robot cannot visit the grids marked as $\text{'}$ X $\text{'}.$

$1.$ Define a Heuristic value which gives the Euclidian distance from a current node to the goal node. Construct the problem graph with this Heuristic value.

$2.$ Implement Greedy search to use this Heuristics, to find a path to the goal node.

$3.$ Implement $A^{*}$ algorithm using the same Heuristics to find a path to the goal node.

for the grid refer to the image attached

write a code in python$($there should not be any plagiarism$)$