Consider the following graph   a) (10 points) Use the large…

Cоnsider the fоllоwing grаph   а) (10 points) Use the lаrgest first algorithm to color the vertices.  Does the algorithm give the chromatic number? b) (5 points) Is it Hamilotnian?  If so find an appropriate cycle and if not explain why.c) (5 points) Is it Eulerian?  If so find an appropriate cycle and if not explain why.d) (10 points) Find a DFS spanning tree and use it to determine a strong orientation for the graph.