Using Depth$-$First Search Graph algorithm from textbook, list the action sequence solution found when searching from start state to goal state.

Whenever a search algorithm iterates through the actions, always use the ordering: U$,$ D$,$ R$,$ L$.$

Since all actions are single character, the answer should be string. For example, if action sequence was $"$U$,$ L$"$ then the answer would be: UL$.$

Solution found by Depth$-$First Search: