Q.1 Simulate A*algorithm with closed list to find path from Start node R to Goal node B of graph given as fig. 1. Add proper remarks to earn full credit. Heuristic values are given in table 1 (5) N 71 87 151 75 Z I 140 s 99 F 92 11$ V 80 70 211 97 142, L P 70 146 98 85 101 H 86 M 75 138 90 B E 12.0 G Fig. 1: Partial Map of Romania hp = 8 . hs = 9 Table 1: Heuristic Values ha=7 h = 7 hc = 4 ho = 6 hm = 3 h = 8 ho = 9 h = 0 h = 5 hy = 2 . ho = 3 h = 9 hp = 4 hy = 6 he = 7 h = 5 hr = 5 hz = 8