1. Assume you can process 200 states per second to search a given game tree using a BFS search. What is the approximate time to search for a goal, assuming the branching factor (BF)=10 and the goal is in level 102. 2. Apply the following uninformed search algorithms for the graph below; assume the start state is s, and the goal states are G, and Gg. In each case, you should list all the expanded states as well as the solution path. (a) Depth First Search (DFS) algorithm. (b) Breadth First Search (BFS) algorithm. (c) Depth-Limited Search (DLS) algorithm with depth-limit = 3. S 8 A/7 B/10 -2- C/5 $ 2 6 D/4 12 GO 4 E/7 -10F/9 H/6 J/8 G20 Submission Guidelines 1. The deadline for online submission is 11:55 pm on Monday 28/12/2020. 2. Add a cover page for your assignment. 3. You only need to submit your work as a one pdf file. 4. Please name your file as: Assignment1.pdf. 5. Only files with pdf extensions are allowed; else you will assign zero. 6. The compressed files are not allowed. 7. Submit your file electronically using the university e-learning system via your account. 8. All submission date and time will be based on timestamps given by eLearning system. Please keep in mind that server time might be mildly different from your clock, it is advisable to submit your assignment 15 minutes before the deadline. 9. The submitted assignment must be done by the student. It is a violation of the university regulations to submit others work and the instructor of this course takes the violations very seriously