please explain in detail

Consider the set of weighted intervals given below, where si is the start time, fi is the finish time, and v is the value of the interval. j 1 2 S; fi 0 6 2 10 9 15 7 18 Uj 2 4 6 p() 0 0 3 1 1 4 7 Solve this instance of the weighted interval scheduling problem, i.e. find a set of (non-conflicting) intervals with maximum total weight