please solve this problem in A search tree i convert the truth table to help you to solve in A search tree please solve in tree not befor solve solved rong in c++ it is not corrected please solve in tree A search algorithm

You have converted the table into a tree to help you with the solution using method A algorithm.

the goal is i

the goal in quesion is i sea the queasion my be you cant solve

%VIL GY : E Given the following set of graph nodes along with their parent node, cost function g(n), and heuristic function h(n). Use Algorithm A (without duplicate check) to find the best path to the goal node. (Hint:- the values in the table indicate the start, leaf, and goal nodes) graph nodes node child of NONE B(A) 0 A 1 B A 1 1 B 5 D B 5 6 E D 1 1 F E 5 G E 2 3 H G D 2 2,6 1 5 0 J G 5 No files submitted . 5 2 E 15 F 8 3 5 H 2 5