In the lecture, the problem Weighted Interval Selection is formulated as an instance of longest path in DAG. There is another formulation with a different DAG whose nodes are endpoints of the intervals $($we may assume all intervals are distinct$).$ Construct such DAG by describing the edges and their lengths and argue that an optimal solution can ve derived by some longest path in this DAG