4 The following graph is given. Let all arcs (links or edges) have the same cost, S is the start node, G is the Goal node, and his the heuristic function. Determine using Breadth-First Search the order of nodes to be visited. Match the left side (node number) to the right side (order of visit). Select zero for the node that is never visited. h(A)=6 A h(G)=0 h(D)=2 h(S)=7 h(B)=5 h(C)=4 Choose Choose [Choose) Choose 3pts 9 Choose Choose Choose Choose Choose)