Given the following graph and the BFS algorithm, give the nodes being visited after the 2 nd iteration starting at 1. Consider installing dependencies for a piece of software. Dependencies are libraries required to run the application. Each library requires their own dependencies which must be installed before the library will compile. In this case, we would like a valid order of dependency installation. How should we determine the ordering By implementing a topological ordering for the dependency graph. By implementing a BFS ordering for the dependency graph. By implementing a DFS ordering for the dependency graph. By sorting the dependencies based on their sizes from the dependency graph