explain briefly

(d) (4%) What kind of heaps is required in heap sort with non-decreasing order? Why? (e) (4%) Consider the single source all destinations problem. Explain why it is required that the graph have no cycles of negative length when negative edge lengths are permitted. (f) (6%) Consider the set representation using trees. If the sets being represented are pairwise disjoint, explain what the collapsing rule is. What scenario is more beneficial for the find operation applying collapsing rule? Why