Question 2.) (20 pts) The computer science department at University X has the courses given below, where some of the courses are prerequisites of others (i.e. must be taken before that course). Prerequisite Course CS101 CS102 CS230 CS240 CS205 CS365 CS101 CS101 CS102, CS230 CS102, CS240 CS230, CS240 a.) Draw the graph showing the relations of the courses given in the table. (5 pts) b.) Is the graph directed? (1 pt) (YES/NO) c.) Is the graph acyclic? (1 pt) (YES/NO) d.) Is the graph weighted? (1 pt) (YES/NO) e.) What is the in-degree of CS230? (1 pt) f.) What is the out-degree of CS240? (1 pt) g.) Assuming the student passes each course at first trial; find an order that allows a student to take all the given courses. Briefly state the steps and the algorithm(s) you use and give the order. (10 pts)