Please answer and provide psuedocode and discuss runtime.

S535 Spring 2018 I. Suzuki 15 (1) Give a minimum length schedule for courses A, B,... , I given in the dag (2) Design an algorithm that, given any dag - (V, E) as above in adjacecy list structure, outputs in O(n+m) time a minimum length schedule in the format: semester 1: A B semester 2: C S535 Spring 2018 I. Suzuki 15 (1) Give a minimum length schedule for courses A, B,... , I given in the dag (2) Design an algorithm that, given any dag - (V, E) as above in adjacecy list structure, outputs in O(n+m) time a minimum length schedule in the format: semester 1: A B semester 2: C