Give an algorithm (in pseudo-code using depth-first search) to determine if a directed graph is connected. Analyze the time complexity of the algorithm (worst case only), assuming that the graph is represented by an adjacency matrix. Identify the base operation. Explain in detail how you got time your answer for time complexity, and base operation.