2. From the following map (figure-1), find the path (root) from city A to city B using the following (20 Points) algorithms: (a) Hill Climbing (b) Greedy Best First search (c) Branch and Bound with Dynamic Programming (d) A* Algorithm 90 151 S 99 71 75 211 90 A. 140 97 P 12 101 118 D 14 138 L 70 M 75 Figure-1: AMap The straight-line distances of each city from city B are as follows, A-366, - -| 60, D-242, E 161, F-I 76, G-77, H-I 51, l-226, L 244, M-241, N-234, 0-380, P-100, R-193, S-253, T-329, U-sn 1 2. From the following map (figure-1), find the path (root) from city A to city B using the following (20 Points) algorithms: (a) Hill Climbing (b) Greedy Best First search (c) Branch and Bound with Dynamic Programming (d) A* Algorithm 90 151 S 99 71 75 211 90 A. 140 97 P 12 101 118 D 14 138 L 70 M 75 Figure-1: AMap The straight-line distances of each city from city B are as follows, A-366, - -| 60, D-242, E 161, F-I 76, G-77, H-I 51, l-226, L 244, M-241, N-234, 0-380, P-100, R-193, S-253, T-329, U-sn 1