Suppose you have the following search space: State
next
cost

A
B
4

A
C
1

B
D
3

B
E
8

C
C
0

C
D
2

C
F
6

D
C
2

D
E
4

E
G
2

F
G
8

Draw the state space of this problem.

Assume that the initial state is A and the goal state is G. Show how each of the following search strategies would create a search tree to find a path from the initial state to the goal state:
Breadth-first search
Depth-first search
Uniform cost search

​