Given the following sct of graph nodes along with their parent node, cosi function g(n), and heuristic function bkn). Use Algorithm A (without duplicate check) to find the best path to the goal node. (Flint:- The values in the table are indicative of the start, leaf, and goal nodes) are cled nede A B C hin) 1 1 3 graph nodes childer gin NONE 0 1 B 5 D 1 E 5 E 2. G.D 2 11 $ G $ 6 1 E F G H 1 J J 2.6 43 120 Marks