Please answer all parts of the question

Use the depth first search (dfs) algorithm starting at vertex 1 to perform topological sorting of the directed acyclic graph shown in Figure 1. Explain each step clearly by drawing the dfs trees generated and the output array at each step. Write an algorithm that finds the sum of the in-degrees of all the vertices in a directed graph. Assume that the directed graph is represented by an adjacency list. What is the time complexity of your algorithm in part (b) in terms of the number of vertices and edges? Justify your