$15)$ Give a greedy algorithm to make a reasonable attempt at coloring a graph in $(+)$ time.$$ Explain how you can be sure your algorithm runs in that time.$$ Give an example of a case where your algorithm does not produce an optimal result. Please the algorithm in pseudo code, and answer the question thoroughly.