$1.[5$ pts$]$: Fill out the table below to find the shortest path from Noy $($upper left$)$ to $\backslash ($ G R $\backslash )($lower right$)$ using $\backslash ($ A$^\{*\}\backslash )$ search in the manner in which it was done in the lecture slides. $\backslash (\{\}^\{1\}\backslash )$ The distances along each edge are given. The italicized numbers in parentheses are the heuristic values $($the underestimates of the actual distance to GR from the given node$).$ At the bottom, list the shortest path from Noy to GR$.$

Solution: