he solution path found is A. S-E-H-Q-R-F-G B. S-D-E-R-F-G OC. S-E-R-F-G OD. S-P-Q-R-F-G 9) For Breadth First Search, the following tatements are correct: 1 po A. Fringe is a FIFO queue. B. Fringe is a LIFO queue. C. Expand shallowest unexpanded node first. D.Nodes are added to the front of the OPEN list. 1 po 10) When a priority queue is used instead of a imple queue in a Breadth First Search, we insert nodes i he increasing order of the cost of the path so far. This is he Uniform-cost Search algorithm. Find the cost of the olution path found using Uniform-cost Search. A. 24 B. 28 OC. 23 OD. 29 ou may submit any number of times before the due dat he final submission will be considered for grading. Submit Answers