Artificial intelligence topological sort coding with some implements

You are expected to implement a topological sort procedure in order to obtain a class-precedence list for a given class hierarchy. I allow you to reuse any code provided that you clearly state where you found it and how you used it and/or adopted it to your needs for this homework. In any case, the code component will be worth 2%. As you know, Winston explains, in considerable detail, the workings of topological sorting. You should test your program at a minimum with the following figures from Winston to make sure that it reports class-precedence lists correctly: • Figure 9.2 (0.5%) • Figure 9.4 (0.5%) • Figure 9.5 (1%) [do it both for Crazy (0.5%) and Jacque (0.5%)] • Figure 9.6 (1%) [do it both for Crazy (0.5%) and Jacque (0.5%)] Figures are here : [login to view URL]