which path will each search algorithm return? Assume that the successor functions operate in a way that nodes are explored in alphabetical order whenever possible? You can ignore expanded paths and only report returned paths as how we covered in the class $($such as S$->$A$->$G$)1.$ Breadth first search, $2.$ depth first search, $3.$ uniform cost search, $4.$ A$*$ search, $5.$ which node will be expanded by uniform cost search but not A$*?$