Design an ADT interface that gives clients the ability to pose and solve job scheduling problems. Write a class that implements your interface, basing your solution to the job-scheduling problem on a reduction to the shortest-paths problem in acyclic networks, as in Program 21.8.
![510_d92650cc-111f-48a7-8e1b-5c26646b9832.png](https://secure.tutorsglobe.com/CMSImages/510_d92650cc-111f-48a7-8e1b-5c26646b9832.png)