Write a program using C++ for the instructions below.

The smallest last ordering: choose a vertex with the lowest degree and put it in front of the sequence fterwards, temporarily remove the vertex from the graph. in this way, if a vertex v is removed from the graph so is each edge(vu), which lowers the degree of each neighbor of v. After the sequence of vertices is established, the links temporarily removed are restored and the for-loop is executed to assign colors to vertices. sequentialColoringAlgorithm (graph = ( V, E)) | put vertices in a certain order Vt, V2, Vn put colors in a certain order ci, C2, .,C for i = 1 to P1 j= the smallest index of col0r that does not appear in any neighbor of vi; color(V)