3. From the graph above determine the vertex sequence of the shortest path connecting the following pairs of vertex and give each length: a. V & W b. U & Y c. U & X d. S & V e. S & Z 4. For each pair...

3. From the graph above determine the vertex sequence of the shortest path connecting the following pairs of vertex and give each length:

a.
V & W

b.
U & Y

c.
U & X

d.
S & V

e. S & Z

4. For each pair of vertex in no. 3 give the vertex sequence of the longest path connecting them that repeat no edges. Is there a longest path connecting them?

Extracted text: DOO Graph A Graph B