CISC4080 COMPUTER ALGORITHMS monday Homework 1 Assume the use of procedure GREEDY presented in the class to answer all questions below. (a) What is the number of colors needed to color each of the graphs according to procedure GREEDY? (b) If the number of colors obtained by using procedure GREEDY results in the number of colors which is greater than the minimum number of colors needed to color the graph, provide the order of the graph vertices that would result in the minimum number of colors needed to color the graph when procedure GREEDY is used