Q2 This question refers to the undirected weighted graph given below: 4 A is the start state and G is the goal state. The costs are given as weights on the graph. Apply each of the following algorithms on the graph until a solution is found. It is assumed that graph search is used, and the same state is never expanded more than once. It is also assumed that the children of each node are ordered alphabetically. 1. Breadth-first search. Is the solution found optimal? 2. Depth-first search. Is the solution found optimal? 3. A* with the following heuristic function: h(n) 99 8 7 1 4 0 Is the solution found optimal