Q4: Given the following tree representing a state space and assuming that I and L are goal nodes, give the sequence in which nodes are visited using: BFS, DFS, DLS (Depth Bound - 2), IDS. BFS: DFS: DLS (Depth Bound - 2): IDS: In the graph attached we want to find a path from A to H using uniform cost. Show your work