Given an array of intervals I[1, . . . , n] where I[i] = [si, fi], find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Precisely define the...

Given an array of intervals I[1, . . . , n] where I[i] = [si, fi], find the minimum
number of intervals you need to remove to make the rest of the intervals non-overlapping.

Precisely define the subproblem.
Provide the recurrence equation.
Describe the algorithm in pseudocode to compute the optimal value.
Describe the algorithm in pseudocode to print out an optimal solution.