Informed search

Here is a search graph within a grid world. Each node located in a block, each edge has a number showing the actual travel cost between the two corresponding nodes. For example, node A located in block $\backslash [4,1\backslash ],$ node C located in block $\backslash [4,2\backslash ].$ The actual travel cost from A to C is $8.$

$1$: Problem representation

In this part, you have to define $\backslash ($represent$\backslash )$ the problem, that is to tell the computer what the problem look like. For example, your representaion should be able to express the location of the nodes, and the travel cost between connected nodes. $\backslash ($Also$,$ don't forget to define the grid world, you may need it for the heuristic.$\backslash )$

# Define the graph

graph $=\{$

$$ # Your code here.

$$ # hint: $\text{'}$A$\text{'}$: $[(\text{'}$B$\text{'},3),(\text{'}$C$\text{'},8),(\text{'}$D$\text{'},5)],...$

$\}$

positions $=\{$

$$ # Your code here.

$$ # hint: $\text{'}$A$\text{'}$: $(4,1),...$

$\}$

Please follow carefully the instractions, Thank you!