Implementation of a Depth First Search (DFS) in C++

You are to implement a straightforward application of Depth First Search (DFS). Find all reachable nodes from a given start node. You are allow to use sample code from the text which is provided. There is a short deadline, and I will be tipping you a lot of the solution is good and follows the style of the book provided. Input: - The input should be read from the file "[login to view URL]" Use REDIRECTION for this. - The first line of the input contains only one token, n - the number of nodes of an undirected graph. - Next, the boolean adjacency matrix is read in line by line, n lines in total. The program should check that all diagonal elements are 0 (i.e. false) and that the matrix is symmetric; print an error message if this is not the case. - The last line of the input is only one token, the chosen start node s E {1, ..., n}. Method: Use DFS starting at node s. Outut: Print out the nodes reachable from s, including s. DEADLINE: 15 hours from posted. Payment, you will receive $30 dollars for a correct solution, if I am happy with the solution, then you will get a tip of $15 - $30 adding up to a $45 - $60 project. I will make sure that you get rewarded for your hard work. Please meet the deadline, I can hire you int he future if you I am satisfied with your work. I usually have bigger jobs with way higher paying... thanks!