For each of the following problems: design a greedy algorithm that solves the problem; de-

scribe your algorithm with clear pseudocode; and prove the time efficiency class of your

algorithm

2-coloring input: an undirected graph G- (V, E) (c) | output: a sequence coloring-Hmoju E V and c E {1,2) such that each u E V appears exactly once in colors , and no adjacent vertices are assigned the same color