Output: 1 2 4 5 3 6 7 8 9 10 11 12

Use python language for this assignment. But you must write all the functions by yourself with explaining how to run the code. please don't copy the code already exist in chegg.

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, 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. Input (input.txt): in hun 12 12 23 24 25 36 45 47 52 56 57 63 68 78 7 10 87 97 109 10 11 11 12 12 10 5 10 09 12