(c) Finally, consider one last algorithm for the maximum clique problem. First, calculate all cliques of size k = 2 (those would be the edges of the graph). Then, compare them pairwise: if they have k-1 nodes in common and the graph also contains the missing edge between the pair, we can merge them into a clique of size k + 1 = 3. This algorithm can be generalized for any k. Does that algorithm produce a maximum clique? Why/Why not? What is the worst-case runtime complexity of the algorithm?