PLEASE WRITE COMMENTS AND PSEUDO CODE WITH CODE! Maximum Clique Problem 1: Introduction Problem description and (if any)

[answerhappygod]

PLEASE WRITE COMMENTS AND PSEUDO CODE WITH
CODE!
Maximum Clique Problem
1: Introduction
Problem description and (if any) background of the
algorithms.
Description:
The complete subgraph with the largest number of vertices in an
undirected graph G is called the maximum clique. Input an
undirected graph with n vertices (vertex number is 1 ~ n) and m
edges, and find the number of vertices of its maximum clique.
Input:
Input multiple test cases. The first line of each test case
contains two positive integers n and m, and the next m lines
contain two integers s and t in each line, indicating that there is
an edge between vertex s and t, which ends with input n=0 and m=0,
assuming 1n50 and 1m300.
Output:
Output one line for each test case, indicating the number of
vertices of the corresponding maximum clique.
Sample Input
5 6
1 2
2 3
2 4
3 4
3 5
4 5
0 0
Sample Output
3