Plz $10$ minit solve Consider the scarch space below, where $A$ is the start node and $G$ is the goal state. Ares are labeled with the cost of traversing them. Ties are broken using the alphabetical order$-$

A$-$ Find a solution using an Iterative deepening search, how many nodes are expanded:

B$-$ Find a solution using uniform cost search, what is the cost of that solution:

C$.$ Find a solution using a depth limited search with $L=4,$ how many nodes are generated: