Given the state space graph shown below, where the start and goal states are S and G, respectively. 3 A S D 3 8 E 1 0 2 G For each of the following search strategies: (a) Depth-first search, (b) Breadth-first search, (c) Uniform cost search, and (d) Iterative Deepening: Write out the order in which states are added to the fringe. What is the path returned by each strategy? What is the total cost of each path? Assume ties are resolved alphabetically (earlier alphabetical order are expanded first).