Exercise $1(10$ points$).$ Consider the $\backslash (\backslash$mathrm$\{$A$\}^\{*\}\backslash )$ algorithm using a perfect heuristic function $\backslash ($ h $\backslash ),$ i$.$e$.,$ for any node $($state$)\backslash ($ n $\backslash ),\backslash ($ h$($n$)\backslash )$ equals the minimal cost from $\backslash ($ n $\backslash )$ to a goal state. Modify the pseudocode for $\backslash (\backslash$mathrm$\{$A$\}^\{*\}\backslash )($fig$.3\mathrm{.}7)$ so it improves in space and$/$or time complexity as much as possible. The better the solution the higher the grade. Explain your answer.