Question: Another NP-complete problem is the 3-vertex colourability problem. In order to obtain a proper coloring of a graph G = (V,E), three colors are assigned to the vertices in such a way that no adjacent vertices are similarly colored. Write a test tube program to solve this problem assuming an initial tube t. Describe its functioning.