This function generates a graph of size n, where the vertices of this graph represent a clique. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of the loop, which shows the algorithm's correctness. def make_clique (n): g = [None) in i = 0 while i <:>