Which sequences of paths are explored by BFS and DFS in this problem? Exercise 2 Given the graph represented in t Figure 1, where n, is the initial state, n, is the final state, each edge nn' is labeled by a cost corresponding to the value of the function g, and each node n is labeled by the value of the heuristic (h). Questions: 1. What is the heuristic of n7? 2. Give the value of f(n,) Tipe 1 3. Give the content of the list Open and Close using the Breadth first Search algorithm 4. Find a solution using A* algorithm 5. What about admissibility if this heuristic ?