Consider the following graph, where node $A$ is the start state.

Suppose the goal state is node L$.$ List the order in which nodes will be visited for the following algorithms:

Breadth$-$first search

Enter your answer in the form $x,Y,Z($no spaces$)$

Depth$-$limited search with limit $3$

Enter your answer in the form $x,Y,Z($no spaces$)$