1. Part of Problem 7.31 on page 326 of the textbook. In problem 7.31 the scheduling problem is defined and the book asks you to show the problem is NP-complete. You need not do this. For this homework problem just show that the scheduling problem is in NP You should use a verifier to do this. Say what the input to them verifier is, what the verifier does on its input, and why the verifier runs in polynomial time. 1. Part of Problem 7.31 on page 326 of the textbook. In problem 7.31 the scheduling problem is defined and the book asks you to show the problem is NP-complete. You need not do this. For this homework problem just show that the scheduling problem is in NP You should use a verifier to do this. Say what the input to them verifier is, what the verifier does on its input, and why the verifier runs in polynomial time