java please

You need to solve a graph coloring problem using a greedy algorithm. It means that you need to find the minimum number of colors required to highlight each vertex in the graph. The vertices of the graph should be highlighted in such a way that no two adjacent vertices have the same color. 2 Six 5 3 (Techie Delight, n.d.) Step 1: Construct the graph above. Step 2: The graph should have a list of vertices and the edges that connect them. Step 3: Provide the structure to store the list of colors. Step 4: Implement the ColorGraph method that takes the graph and the number of nodes as the input parameters. Step 5: The ColorGraph method should display the color that is assigned to each vertex. Note: You can use any programming language to solve this issue. You need to implement the following: 1. Create a BuildGraph method. It should create the graph based on the number of vertices and the edges that connect them. 2. Create the array list or the array that stores the list of colors. 3. Create the ColorGraph algorithm. Make sure that no two adjacent vertices have the same color. You need to validate the adjacent vertex color before assigning the color to the vertex. If the color is already assigned to the vertex, then pick a different color from the color array list