Consider the following graph and the heuristic values of each state. The start state is S and the only goal state is G. B E S A Heuristic BCD E G 6 0 6 4 1 10 0 a) What path would uniform cost graph search (UCS) return for this search problem? b) What path would greedy graph search with provided heuristic return for this search problem? c) What path would A* graph search, using the provided heuristic, return for this search problem? Act Go to