For each pair of vertex give the vertex sequence of the longest path connecting them that repeat no edges. Is there a longest path connecting them? a.)S & Zb.)S & Vc.) U & Y A. Consider the following...

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

a.)S & Z
b.)S & V
c.) U & Y