2.) (30 points) A path in a graph is called simple if all of its vertices are distinct (but not all vertices in the graph have to be visited). In the graph depicted below, how many simple paths are there from v to w? Justify your answer. CO (O 2.) (30 points) A path in a graph is called simple if all of its vertices are distinct (but not all vertices in the graph have to be visited). In the graph depicted below, how many simple paths are there from v to w? Justify your answer. CO (O