Given is the graph below. Determine a coloring with the a) Greedy-Algorithm using the lexicographical ordering of the vertices a b-c-d- e-f-g-h-i-j. b) DSatur-Algorithmus. If there are several nodes (with the same degree) to choose from, select the lexicographically smaller one. the lexicographically smaller one, e.g. a before b. The order must be recognizable. c) RLF, start with a, in case of alternatives choose the lexicographically smaller one. Also here the steps must be figured out. b d g h j