sir i need answer

Problem-02 (For Even ID Students): Consider the following graph. Find the most cost-effective path to reach from start state A to final state J using A* Algorithm. 10 A 3 6 F 6 1 7 5 (G 2 8 (B H 3 7 3 1 2. 3 8 5 5 5 3 E 3 5 J Solution Hints: The numbers written on edges represent the distance between the nodes. The numbers written on nodes represent the heuristic value. Here, node A is the start state and node J is the goal state. For efficiency, you can skip backward ancestor if needed. . Problem-01(For Odd ID Students): Solve 8-Puzzle Game using A* Algorithm. Given an initial state of a 8-puzzle problem and final state to be reached- 2. 8 3 1 2 3 1 6 4 8 4 7 5 7 6 5 Initial State Final State Find the most cost-effective path to reach the final state from initial state using A* Algorithm