!! FOR ALL PARTS !!

The graph search algorithms are important in Al. This assignment considers the following uninformed graph search algorithms in a given graph. 1. Breadth First Search (BFS) (2 points) 2. Depth First Search (DFS) (2 points) 3. Iterative Deepening Search (IDS) (2 points) 4. Uniform Cost Search (UCS) (2 points) Your task is to implement the above algorithms to find the traversal path and exact path of any given graph (State Space Graph). You can use any programming language. The graph search algorithms are important in Al. This assignment considers the following uninformed graph search algorithms in a given graph. 1. Breadth First Search (BFS) (2 points) 2. Depth First Search (DFS) (2 points) 3. Iterative Deepening Search (IDS) (2 points) 4. Uniform Cost Search (UCS) (2 points) Your task is to implement the above algorithms to find the traversal path and exact path of any given graph (State Space Graph). You can use any programming language