Subject: Design and Analysis of Algorithms.

Please Use Python or Java programming.

Implement the algorithm to find Strongly Connected Components (SCC) in a directed graph. This will also require implementing Depth First search and modifying DFS to be able to modify the search order at the top level as required by SCC. Your program will read a graph description from a file. The graph will have n vertices, with vertices numbered from 1 to n. The first line of the file will contain a single integer value, n which is the number of vertices. Each line after that will contain a pair of integers specifying a directed edge of the graph; the first integer is the source vertex number for the edge, the second integer is the destination vertex number for the edge. You should read all the edges from the file and use them to build an Adjacency List representation of the graph. Your program should be able to handle a graph with an arbitrary number of vertices and edges. For this programming assignment, you must implement the Graph Adjacency List representation, DFS, Graph Transpose, and SCC algorithms yourself. NNNM in ini 0001 Input (input.txt) : 12 12 23 24 25 36 45 47 52 56 57 63 68 78 7 10 87 8 00 w 10 97 109 10 11 11 12 12 10 12 Output: 1 245 36 7 8 9 10 11 12 Ethical Issues Since all of you will be doing the same assignment, experience tells us that there is high chance of copying. Besides this is a very common programming problem. You can easily find the solution online. Let us warn you that any case of plagiarism (copying) will be handled severely with nearly zero tolerance and may even result in suspension from the course irrespective of whether you were the server (source of code) or the client (who copied the code). Submission Guidelines You can use any programming language for this assignment. But you must write all the functions by yourself. You must submit all the codes/files used in this assignment. There must be filed name "readme.txt" explaining how to run the code