For the search problem shown below, S is the start state, and G is the (only) goal state. Break any ties alphabetically. What paths would the following search algorithms return for this search problem? Give your answers in the form 'S - A-D -G'. (6 points: 2 points each) 1 1 5 2 5 a) BFS b) UCS c) DFS