Consider the search space below, where S is the start node G is a goal node Each node is labeled by a capital letter and the value of a heuristic function. Each edge is labeled by the cost to traverse that edge. the number gives the estimate of the distance to the goal. Assume that uninformed search algorithms always choose the down branch first when there is a choice. A, h=4 C, h=4 E, h=1 3 3 2 S, h=6 1 G, h=0 3 2 B, h=4 D, h=3.5 F, h=1 use Greedy search strategy to find path solution path cost please show the solution steps Answer: Paragraph