ā£What are the steps for solving a dynamic programming problem?ā£What kinds of dynamic programming problems are there?ā£What is the recurrence for the $LCS$ (longest common subsequence) problem?ā£What is the recurrence for the LPS (longest palindromic subsequence) problem?ā£What is the recurrence for the LRS (longest repeated subsequences) problem?ā£What is the recurrence for the SCS (shortest common supersequence) problem?ā£What is the recurrence for the LIS (longest increasing subsequence) problem?ā£What is the recurrence for the Matrix Chain Multiplication problem?ā£0-1 Knapsack problem (discrete)ā£0-1 Knapsack problem (continuous)ā£Diff Utility04-dynamic-programming.pdf171.6KB