1. Informal description of an algorithm being a solutions basis:

2. Algorithms pseudocode implementation:

3. Justification of an algorithms correctness:

4. Estimation of algorithms complexity:

Question= The clique in a graph G=(V,E) is a maximal set of graph's vertexes in which any two vertex are connected via an edge form the set E (maximal == no node can be added). Design a greedy algorithm that finds a clique in an input graph. Give a detailed description of your method and estimate its complexity.