Given the following graph with the start node $S$ and the goal node $M,$ write the order in which breadth first search will expand the nodes for this problem. At each step, list the nodes stored in the frontier and the reached set.