Algorithms question, thanks

T. Let G = (V. E) be an undirected graph with n nodes. Recall that a subset of the nodes is called a clique if every two of them are joined by an edge (a) Consider the following LARGEST DEGREE FIRST1 greedy algorithm: Sort the nodes in order of decreasing degree v largest degree node in G = (V. E) C {v), remove v from V while not empty V do for each node ueV (largest degree to smallest) do if u is connected to every node in C then Remove u from V return C Give an example where the first node selected by the greedy algorithm is part of a clique with maximum size, but the greedy algorithm does not return a maximum- sized clique