Problem 1: Given the below tree where G1, G2, G3, G4 are goal states. The numbers in black represent the actual cost and the numbers in red represent the heuristic values. What solution path would you find if you apply Greedy Search? Please use queuing technique in your solution and also write the path ( 10 pts) 301 A N 7 1 20 15 10 B D 3 4 1 2 18 19 10 12 E G3 H 2 1 0 0 10 L G1 G2 J K 1 0 G4