Question: a) Define a well-ordered set.
b) Describe an algorithm for producing a totally ordered set compatible with a given partially ordered set.
c) Explain how the algorithm from (b) can be used to order the tasks in a project if tasks are done one at a time and each task can be done only after one or more of the other tasks have been completed.