B. Choose the correct answer (4 marks) 1 Informed graph search algorithm means? 2 Which of the following algorithms is considered as uninformed algorithm that finds the shortest path between any two nodes in the graph 3 Optimal algorithm is defined as the algorithm that A. there is no information about the problem more than its definition B. there are some information about the problem help in finding the solution C. the algorithm cannot handles unexpected events D estimated cost the cheapest path from start node to the goal node A. A* algorithm B. Heuristic C. BFS algorithm D. Dijekstra algorithm A. Find the cheapest solution B. Does not handles unexpected events C. optimal solution in term of cost and complexity D. Find the closest node near the goal to find the solution quickly A. A path from the current situation of a problem to the desired situation B. A set of logical step to find the problem solution C. The path to followed to find a problem solution D. All of previous 4 The algorithm is defined as