D AT ASTRUCTURE AN DALGORITHM DESIGNQuestion Question Two (20 Marks) a. New students enrolling for Information Engineering need to take some certain courses before graduation. Given the following list of courses to be completed with a precedence constraints, Courses {1= Algorithm Analysis and Design, 2= Complexity theory, 3= Intelligent Systems, 4= Introduction to Information Engineering, 5= Cryptography, 6= Engineering Computing, 7= Data Mining}. The courses can be taken in any order as long as the following course prerequisites are met: 6 and 4 are prerequisite for 7, 1 and 2 have no prerequisites, 3 requires 1, 2 and 7, 1 is prerequisite for 4, 5 requires 2, 3, 4 and 7, while 6 requires 1, 2 and 5. The student can take only one course at a time. i. Model a Diagraph to represent the courses and constraints (5 marks) ii. Determine in which order you will schedule your time table using topological sorting for the diagraph. (3 marks) iii. Give 2 practical applications of topological sorting. (2 marks) Note You can draw the adjacency list to indicate constraint before modeling the diagraph Vertex= course, edge = Precedence Constraint