Consider the following oriented graph that represents the road map between cities (figure 1). The weights on the link represent the distance between connected cities. Let A be the initial city and G the destination city. Assume the following set of the straight line distance between G and other cities. A BCDEF 6 7 3 10 4 4 3 A B 1. Give the complete search tree from the following graph with depth limit =4. 2. show how the uniform cost search algorithm works for reaching the goal. Is it optimal in this case, why? 3. show how the greedy best first search works for reaching the goal. Is this algorithm complete in this case, why? Is it optimal in this case, why by giving one example?. 4. show how the Hill Climbing search works for reaching the goal. Is this algorithm complete in this case, why? E 3 2 3 + F C 5 G Figure 1 D