Consider the following generalization of the Activity Selection Problem: You are given a set ofnactivities each with a start time si, a finish time fi, and a weight wi. Design a dynamic programmingalgorithm to find the weight of a set of non-conflicting activities with maximum weight. Please provide Pseudocode.
Complete solution requirements
• The precise definition for what cell i or cell (i, j) of your table holds.
• The formula for how to fill in the cells of your table.
• The base cases for your cells.
• The specific cell that holds the solution.