I need solve this assignment

1. Use Graph coloring to solve the following problem: Exanwscheduhng Suppose you want to schedule final exams and, being very considerate, you want to avoid having a student do more than one exam a day. We shall call the courses 1,2,3,4,5,6,7. In the table below a star in entry U means that course [and] have at least one student in common so you can't have them on the same day. What is the least number of days you need to schedule all the exams? Show how you would schedule the exams. (8 M AR KS) 1 2 8 4 5 6 7 1 k . 1 a a 2 .. . i 3 w k .. 4 w .. 1 ,, 5 1 , 6 .. .. .i 1 7 .. k * 2. Construct a graph using the given Adjacency matrix. Adjacency Matrix- group 5 1, 0, 1, 0,1, 0, 0,0,0, LQQQQQLQL QLQQLQQQQ 1, 0,0, 0, 0, 1,0,0, 0, QLLQQLQQQ 0, 0,0, 1, 0, 0,0, 1, O, LQLQQQLQQ 0, 0, 1, 0, 1, 0,0, 1, O, 0, 1,0, 0,0,0, 1, 1, O, (8 MARKS)