Bob loves foreign languages and wants to plan his course schedule for the following years. Heis interested in the following nine language courses:LA15, LA16, LA22, LA31, LA32, LA126,LA127, LA141,...

Bob loves foreign languages and wants to plan his course schedule for the following years. Heis interested in the following nine language courses:LA15, LA16, LA22, LA31, LA32, LA126,LA127, LA141, andLA169. the course prerequisites are:

(a)LA15:(none)

(b)LA16: LA15

(c)LA22:(none)

(d)LA31: LA15

(e)LA32: LA16, LA31

(f)LA126: LA22, LA32

(g)LA127: LA16

(h)LA141: LA22, LA16

(i)LA169: LA32.

1. Use Topological sort algorithm to find the sequence of courses that allows bob to satisfy all the prerequisites.


2. What is the shortest path to take course LA169. Use one of the algorithms described in the class to find the shortest path. Please show the steps.