I would like to know if I did these correctly:

Consider the following graph. V(G) = {V1, v2, v3, v4}, e(G) = {e1, e2, e3, e4, e5, e6}, E(G) = {(el,[V1,v2]),(e2,[v2,v3]),(e3,[v3,v4]),(e4,(v4,v1)), (e5,[v2,v4]), (e6,[v1,v3])} Draw a picture of the graph on scratch paper to help you answer the following two questions. How many paths exist from v1 to v4? 5 What is the length of the longest trail from v1 to v4? 4 Consider the following graph. V(G) = {v1, v2, v3, v4}, e(G) = {e1, e2, e3, e4, e5}, E(G) = {(e1, [v1, v2]), (e2, [v1, v2]), (e3, [v2, v3]), (e4, [v3, v4]), (e5, [v3, v4])} Draw a picture of the graph on scratch paper to help you answer the following three questions. What is the degree of the graph G? 10 How many simple circuits can be identified in graph G? |2 How many walks of length 5 are there from v1 to v4? 8Can you create a graph that has the following characteristics: a. Full binary tree, eight internal vertices, seven terminal vertices. b. Binary tree, height 4, eight terminal vertices. c. Full binary tree, sixteen vertices. cl. Completely populated, full binary tree with an odd number of terminal vertices. O a. No, b. Yes, c. No, d. Yes ' a. No, b. No, c. No, d. Yes " a. Yes, b. Yes, c. No, d. No ' a. No, b. Yes, c. No, cl. No