An Algorithm for Topological Sorting The basic algorithm for topological sorting is very simple: 1. Find a vertex that has no successors. 2. Add the vertex to a list of vertices. 3. Remove the vertex from the graph. 4. Repeat Step 1 until all vertices are removed. Write code to Implementing the Algorithm

Can you please also explain what are the differences between the two algorithms?

1) Design an algorithm using DFS that detects whether graph G has a cycle. State and explain running time. Graph G need not be connected. Write in Pseudocode, please. 2) BFS refresher: Suppose you have an n × n chessboard and a knight placed in one of the squares. Youwould like to find out the fewest number of moves needed to reach a given target square. Design an algorithmfor this task stated formally below: Input: An n × n chess board, a starting square S, and a target square T.Output: The fewest number of moves a knight takes to move from S to T. Write in Pseudocode, please.