number 2. show the bin contents after the algorithm terminates

color node, with c end for The degree of a graph is the largest number of edges leavin coloring algorithm will use C colors where C is 1 the graph. It is possible to do better than this, but the al scope of this book. or greater than the degre gorithm is beyond 11.1.6 EXERCISES 1. What path would the greedy traveling salesperson algorithm find if th matrix is From To 23 45 6 7 5 1 2 16 17 2 10 7 18 8 15 9 11 134 3 20 14 12 6 19 Is the path it finds optimal 2. Another technique for bin packing is best fit, where each object is placed n the bin so that the least amount of space is left over. New bins are started only when an object will not fit in any of the current bins. Write an algo- rithm for best fit. Show how best fit would have handled the two unsorted examples in the text 3. Another technique for bin packing is next fit, where we keep putting objects into a bin as long as they will fit. The first object that does not fit in