first name: afa last name :uch please if you can solve this to me. thank you

Question 1: you are going to create a T1 triplet using the rank in the alphabet of the last three letters of your first name, then create a T2 triplet using the rank in the alphabet of the last three letters of your name. Thus For Alain Cournier, on Get ain on replacing one with 1, i by 9 and n by 14 where T1 = (1, 9, 14) and ier on replacing i with 9, e by 5 and r by 18 where T2 = 19,5, 18). Calculate T1 and T2 from your first and last name. We consider the graph G1 = (S, U) with: S = {0, 1, 2,..., 8, 9), each vertex will represent a triplet. The correspondence is given in the two tables Tab1 and Tab2. U: a set of pairs (i, j) E U if and only if the box i fits into the box j. For example (3,7) will be an arc of G1 if and only if the box (12,9,10) fits into the box (2,1,2). Question 2: Give a graphical representation of the graph G1. Question 3: Give a representation by matrix of the graph G1. 1 2 3 4 (12,29,14) (12,9,10) (1,2,1) (10,15,14) (25,28,13) Tab1: Table of correspondence between vertices of the graph and triples (part 1) 5 (50,28,35) 6 7 (2,3,2) (2,1,2) 8 T1 9 T2 Tab2: Correspondence table between vertices of the graph and triples (part 2). Question 4: Give a representation by adjacency lists of the graph G1. Question 5: For this graph G1, a) Let u 1 = 4, 6, 3, 0, 1, 5. Is ui a path of G1? b) Let u2 = 4, 6,3,0, 1, 5. Is u2 a chain of G1? c) Give a path of length strictly greater than 1 containing the vertex 8. Question 6: For this graph G1, a) Let u3 = 6, 0, 1, 2, 3, 6. Is u1 an elementary cycle of G1? b) What is the degree of vertex 8? c) Give a cycle of length strictly greater than 5 containing the vertex 9. Question 7: For this graph G1, give the trace of a particular depth route you will give the stacking and unstacking numbers for each of the vertices. Question 8: Give a linear extension of the graph G1. Question 9: For this graph G1, give the trace of any route. You will explain why your journey is not a deep journey. Question 1: you are going to create a T1 triplet using the rank in the alphabet of the last three letters of your first name, then create a T2 triplet using the rank in the alphabet of the last three letters of your name. Thus For Alain Cournier, on Get ain on replacing one with 1, i by 9 and n by 14 where T1 = (1, 9, 14) and ier on replacing i with 9, e by 5 and r by 18 where T2 = 19,5, 18). Calculate T1 and T2 from your first and last name. We consider the graph G1 = (S, U) with: S = {0, 1, 2,..., 8, 9), each vertex will represent a triplet. The correspondence is given in the two tables Tab1 and Tab2. U: a set of pairs (i, j) E U if and only if the box i fits into the box j. For example (3,7) will be an arc of G1 if and only if the box (12,9,10) fits into the box (2,1,2). Question 2: Give a graphical representation of the graph G1. Question 3: Give a representation by matrix of the graph G1. 1 2 3 4 (12,29,14) (12,9,10) (1,2,1) (10,15,14) (25,28,13) Tab1: Table of correspondence between vertices of the graph and triples (part 1) 5 (50,28,35) 6 7 (2,3,2) (2,1,2) 8 T1 9 T2 Tab2: Correspondence table between vertices of the graph and triples (part 2). Question 4: Give a representation by adjacency lists of the graph G1. Question 5: For this graph G1, a) Let u 1 = 4, 6, 3, 0, 1, 5. Is ui a path of G1? b) Let u2 = 4, 6,3,0, 1, 5. Is u2 a chain of G1? c) Give a path of length strictly greater than 1 containing the vertex 8. Question 6: For this graph G1, a) Let u3 = 6, 0, 1, 2, 3, 6. Is u1 an elementary cycle of G1? b) What is the degree of vertex 8? c) Give a cycle of length strictly greater than 5 containing the vertex 9. Question 7: For this graph G1, give the trace of a particular depth route you will give the stacking and unstacking numbers for each of the vertices. Question 8: Give a linear extension of the graph G1. Question 9: For this graph G1, give the trace of any route. You will explain why your journey is not a deep journey