gin) hin) Given the following sct 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. child of NONE bede A B C. 1 1 B 6 1 (Flint:- The values in the table are indicative of the start, leaf, and goal nodes) E F G . D E E G.D 1 5 2 2 16 3 2,6 @ 93) weight between it play and hidden langer and olPlayer own agrentee use Mile for Capture mapping Viv J G 03 20 Marks gin) hin) Given the following sct 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. child of NONE bede A B C. 1 1 B 6 1 (Flint:- The values in the table are indicative of the start, leaf, and goal nodes) E F G . D E E G.D 1 5 2 2 16 3 2,6 @ 93) weight between it play and hidden langer and olPlayer own agrentee use Mile for Capture mapping Viv J G 03 20 Marks