I have a Question on Dynamic programming algorithm Design

"Design an algorithm that gives an optimal solution for each instance of the weighted interval scheduling problem. There is no known greedy algorithm that achieves this, so it is highly unlikely that you will be able to nd one today. Instead, use dynamic programming. Carefully write down what the subproblems are, and what the recurrence is that relates a solution to a larger subproblem to solutions of smaller subproblems. Hint: define p$($j$)$ as the right most interval that ends before interval j begins. If no such interval exists, then define p$($j$)=0.$ the picture attached illustrates as explained. please design the algorithm using pseudo code and illustrate how the algorithm works for this example from the picture attached."