Question: A clique Ki is the complete graph on i vertices. Given a graph G = (V,E), determine the largest i such that Ki is a subgraph of G. This problem is known as the maximum clique problem (MCP). Write a test tube program to solve it, and discuss its functioning.