You are given the state space shown below, where $A$ is the initial state, and $F$ and $I$ are goal states. The numbers on the edges indicate action costs.

The generic tree search algorithm is not guaranteed to find a solution for this problem. Why?

It can get stuck in the cycle between states $B$ and $E$

It can get stuck in the cycle between states $A$ and $C$

It can get stuck in the unsolvable state $D$

The algorithm is actually guaranteed to find a solution, the above statement is wrong

You are again given the state space shown below, where $A$ is the initial state, and $F$ and $I$ are goal states. The numbers on the edges indicate action costs.

In contrast to tree search, the generic graph search algorithm is guaranteed to find a solution for every state space, if a solution exists.
What is the maximum number of states in the closed list when graph search returns a solution for the above state space?