Calculate the number of paths of length 10 starting at the vertex 1. How many of these paths end at vertex 1? vertex 2, 3, 4, 5?

Determine the circuit of minimal length in the given graph. NEED STEPS Solution. We can chose any initial vertex, we start from A and we list all the possibilitieswith the corresponding lengths.Path LengthA, B, C, D, A 97A, B, D, C, A 108A, C, B, D, A 141A, C, D, B, A 108A, D, B, C, A 141A, D, C, B, A 97We could also have avoided the circuits in opposite directions.A shortest Hamilton circuit is A, B, C, D, A (or A, D, C, B, A) and it has length 97.

pls help me with this Discrete Mathematics

2. Identify 3 different paths in the graph below. e6 y es ez e1 ez ea Path 1: Path 2: Path 3: