Given the graph below, for each pair of vertices given in (i) and (ii) give the vertex sequence of the longest path connecting them that repeats no edges: V3 i. ii. v/ and v v/ and v VI V7 VI V2 V5 V8 16 (b) Give the degree of each vertex of the graph. Give the number of edges. Add the degrees of the vertices and confirm that the sum of the degrees is twice the number of edges.