Consider the directed graph below, where the edge weight represents the actual distance from a source node to a destination node. The heuristic cost between two nodes n and m is, h(n,m) = (n+m) (n-m). Note that S=0 and G=12. 1 2 S 3 1 2 3 2 4 3 4 5 6 7 3 2 6 8 9 10 11 6 2 12 3 G 1. If BFS chooses the lowest-numbered neighbor first, find the BFS path from source node S to goal node G. 2. If DFS chooses the lowest-numbered neighbor first, find the DFS traversal sequence from source node S to goal no de G. 3. Find the Greedy Best First path from S to G. 4. Find the path from S to G using A* Search Algorithm. 5. Find the path from S to G using IDA* Search Algorithm. Activa