Please answer each question and write clearly, thank you.

Consider the following intervals for channel routing problem: [1,3], [4,8], [2,5], [10,12], [11,12 [7,9, 17,11], and [3,8]. 1) What is the density of this set of intervals? 2) Use the left-edge algorithm to group these intervals in rows, such that intervals on the same row do not overlap and draw the interval graph corresponding to this set of intervals. 3) Provide the vertex coloring of this graph corresponding to the solution obtained by the left-edge algorithm Consider the following intervals for channel routing problem: [1,3], [4,8], [2,5], [10,12], [11,12 [7,9, 17,11], and [3,8]. 1) What is the density of this set of intervals? 2) Use the left-edge algorithm to group these intervals in rows, such that intervals on the same row do not overlap and draw the interval graph corresponding to this set of intervals. 3) Provide the vertex coloring of this graph corresponding to the solution obtained by the left-edge algorithm