Perform Iterative Deepening Search algorithm using the graph in the image. N.b start = A and goal = G and solve steps in a tabular form for easiar understanding.

Iterative Deepening Search (IDS) is a graph traversal algorithm that combines the benefits of Breadth-First Search (BFS) and Depth-First Search (DFS). IDS is a systematic method to search the nodes of a tree or graph by increasing the depth level in each iteration.

The basic idea of IDS is to perform a sequence of limited-depth searches, starting with a depth of 0, then increasing the depth incrementally until the goal is found. In each iteration, IDS performs a DFS from the root node up to the current depth limit.

Step-by-step explanation of how the algorithm works:

1. Start with depth limit 0, and perform a DFS search from the root node.
2. If the goal node is found, return it and terminate the search.
3. If the goal node is not found, increment the depth limit by 1 and repeat steps 1 and 2.
4. If the depth limit exceeds the maximum depth of the graph or tree, terminate the search and return "not found".