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.

Write a program that asks for 'name' from the user and then asks for a number and stores the two in a dictionary (called 'the_dict') as key-value pair. the program then asks if the user wants to enter more data (more data (y/n)? ) and depending on user choice, either asks for another name-number pair or exits and stores the dictionary key, values in a list of tuples and prints the list. note: ignore the case where the name is already in the dictionary. example: name: pranshu number: 517-244-2426 more data (y/n)? y name: rich number: 517-842-5425 more data (y/n)? y name: alireza number: 517-432-5224 more data (y/n)? n [('alireza', '517-432-5224'), ('pranshu', '517-244-2426'), ('rich', '517-842-5425')]