my id is 17290664

5. (40p) Employ your id to calculate a specific number that will be used in the question as follows (14290519 will be used here as an example to show you how the number is calculated): take the square of your id 142905192 = 204218933289361 remove all the zeros from the resulting number 204218933289361 24218933289361 consider each consecutive two numbers as an edge in the graph 2-4-2--1-8-9-3--3-2-8-9-3-6-1 remove the reflexive edges (having same starting and ending nodes) from the graph 2-4-2-1-8-9-3-2-8-9-3-6-1 9 Note that for the duplicate edges, your consider only one of them for the graph. For the duplicate 2 -4 --2--> 879 -8 -9.., we used only one of them in the graph. a) Show the adjacency matrix of your graph. b) Does the graph contain a Euler path? If your answer is YES, provide one such Euler path. If No, what will be the minimum number edges that should be removed to form a graph that contains a Euler path? c) What is the chromatic number of your graph? d) What will be the minimum number of vertices in a vertex cut of your graph? e) What will be the minimum bumber of edges in an edge cut of your graph? 5.(40p) Employ your id to calculate a specific number that will be used in the question as follows (14290519 will be used here as an example to show you how the number is calculated): take the square of your id 142905192 = 204218933289361 remove all the zeros from the resulting number 204218933289361 24218933289361 consider each consecutive two numbers as an edge in the graph 2-4-2--1-8-9-3--3-2-8-9-3-6-1 remove the reflexive edges (having same starting and ending nodes) from the graph 2-4-2-1-8-9-3-2-8-9-3-6-1 9 Note that for the duplicate edges, your consider only one of them for the graph. For the duplicate 2-4-2..-> 8-9-8-9.., we used only one of them in the graph. a) Show the adjacency matrix of your graph b) Does the graph contain a Euler path? If your answer is YES, provide one such Euler path. If No, what will be the minimum number edges that should be removed to form a graph that contains a Euler path? c) What is the chromatic number of your graph? d) What will be the minimum number of vertices in a vertex cut of your graph? e) What will be the minimum bumber of edges in an edge cut of your graph