Consider the directed graph below, where $\text{'}$ S $\text{'}$ is the start node, and $\text{'}$ G $\text{'}$ is the goal node.

Which sequences of paths are explored by the following algorithms to this

problem? Show the complete intermediate state space.

a$)$ breadth$-$first algorithm,

b$)$ uniform cost graph search

c$)$ depth$-$first graph

d$)$ A$*$ graph search