please and thank you

2. Using the graph below, find the path from S to G applying each one of the following algorithms: 1. Depth First Search 2. Breadth First Search 3. Uniform Cost Search Recommendation: Follow the steps described in 05 Uninformed Search Extra Practice.pdf. to keep track of the visited list (expanded nodes) and the frontier. 3. List the path (solution) found by each algorithm and answer the following questions: 1. Which algorithm is more efficient in terms of number of nodes expanded? 2. Which algorithm is more efficient in terms of cost? 3. Are there any identical paths and if so, which ones? 4. Make sure to show your work