1. 
   1. Draw the corresponding search tree from start node S looking for goal node G. Break ties alphabetically.
   2. Identify the sequence of vertices popped off the open list and the corresponding path to the goal.

Breadth-First (Use instead uniform edge weights = 1)

States popped off OPEN: _____________________ Path to Goal: ____________________

Depth-First (Use instead uniform edge weights = 1)

States popped off OPEN: _____________________ Path to Goal: ____________________

Uniform Cost Search

States popped off OPEN: _____________________ Path to Goal: ____________________

4 4 A B 3 5 E F 2 4 4 4 A B 3 5 E F 2 4