The Answer to the Question
is below this banner.
Here's the Solution to this Question
The Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point is drawn for each element of the poset, and line segments are drawn between these points according to the following two rules:
1. If in the poset, then the point corresponding to appears lower in the drawing than the point corresponding to .
2. The line segment between the points corresponding to any two elements and of the poset is included in the drawing iff covers or covers .
For divisibility relation on the set , let us draw Hasse diagram:
It follows that 1 is the minimal element, 9, 12 and 125 are the maximal elements, 1is the least element, and there is no the greatest element.
Then let us give the topological sort using the divisibility relation. Since 1 is the minimal element, let Taking into account that 3 is the minimal element of let Further, by analogy, let and Therefore, the topological sort is the following: