Execute Tree Search through this graph (i.e., do not remember visited nodes). Child nodes are returned in left-to-right order, i.e., children of S are (A,B), children of A are (A,G1,G2), and children of B are (A,B), in that order. G1 and G2 are goal nodes. For UCS, Greedy and A search, Show the order in which nodes are expanded, ending with the goal node that is found, or indicate the repeating cycle if the search gets stuck in a loop. Show the path from start to goal, or write "None". Give the cost of the path that is found, or write "None