Question 4 - (Search Algorithms) 3 Start 4 (a) Depth-first search (b) Breadth--first search (c) Uniform-cost search 5 U N Goal For each of the following graph search strategies, work out

the order in which states are expanded, as well as the path returned by graph search. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. Remember that in graph search, a state is expanded only once.