Have some explainations please

0 0(n + m) O None of these 2 Graph Properties Each of the following problems presents a scenario about a graph and a statement about that scenario. For each one, indicate by filling in the appropriate circle whether The statement is ALWAYS true, i.e., true in every graph matching the scenario . The statement is SOMETIMES true, i.e., true in some graph matching the scenario but false in another graph The statement is NEVER true, i.e., true in none of the graphs matching the scenario 1. Scenario: An undirected graph containing two simple paths that share no edges, each of length k for some integer k 2 2. Statement: n > k+1 O ALWAYs OSOMETIMES ONEVER 2. Scenario: A rooted tree found by running DFS from some node of a connected, undirected graph with n 2 2. Statement: Every node in the tree has at most two children O ALWAYs OSOMETIMES O NEVER 3. Scenario: A weakly-connected but not strongly-connected, directed graph with n 2 2. Statement: A simple cycle of length n +1 exists SOLUTION ALWAYS SOMETIMES O NEVER