Q1// In the Figure below, consider the problem of finding the optimal path form Start city to the Goal city through the other cities. In this Figure, the numbers: i) inside the cities indicate the tax...

Extracted text: Q1// In the Figure below, consider the problem of finding the optimal path form Start city to the Goal city through the other cities. In this Figure, the numbers: i) inside the cities indicate the tax that the city takes; ii) outside below the cities indicate the distance from the city to the Goal; and iii) in parenthesis indicate the offer that the city gives. (41) (18) (20) A (40 13 14 F 35 15 8. (50) B(30 Start (26) 20 25 (27) 10 10 Goal (15) 20 20 10 H 38 11 1. Using the A* search algorithm to find the optimal path. 2. Use the FL to suggest a new hybrid system that can improve the result of A* in 1.