What is disadvantage of Greedy Best First Search?

• A. This algorithm is neither complete, nor optimal.
• B. It can get stuck in loops. It is not optimal.
• C. There can be multiple long paths with the cost ≤ C*
• D. may not terminate and go on infinitely on one path