A 9.5 3 5 Consider the state space graph shown above. A is the start state an d G is the goal state. The costs Draw the sown on the graph. Each edge can be traversed in both directions search tree and find path of solution with total cost using Search Algorithm: i) Depth first search ii) Breadth first search iii) Uniform cost search iv) Greedy search