hello thankyou in advance

Activity A Graph Theory A. Consider the following graphs: Graph A Graph B 1.) Which of the following vertex sequence describe paths in the graph given above? a.) STUVWXZY b.) TVWZY C.) STUS d.) UYVTXZYU e.) WVUSTVW 2.) Which paths in no.1 are closed paths? Cycles? 3.) From the graph above determine the vertex sequence of the shortest path connecting the following pairs of vertex and give each length: a.)5 & Z b.)5 & V C.JU& Y D.JU & X e. ) V & W 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? 5.) How many spanning trees are can be generated from its graph? Define 2 spanning trees of Graph A and B. 6.) Which graph has and Euler path? Euler Circuit?(Use Fleury's Algorithm) For those that don't give an explanation? 7.) Which graph contains Hamiltonian Path? Hamiltonian Circuit? For those that don't give an explanation? B. Determine whether the following graphs are planar.Graph 1 Graph 2 C. Consider the graph below. a.) Construct the Matrix Representation of the Graph. b.) Determine whether the graph is simple or not. If it is a simple the adjacenty matrix of the graph and determine the no. of paths of length 2 that it has. =