(Erickson 2.1) Describe recursive algorithms for the following generalizations of the Subset-Sum problem:a) Given an array X[1...n] of positive integers and an integer T, compute the number of subsets of X whose elements sum to T.b) Given two arrays X[1...n] and W[1...n] of positive integers and an integer T, where each W[i] denotes the weight of the corresponding element X[i], compute the maximum weight subset of X whose elements sum to T. If no subset of X sums to T, your algorithm should retu

Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial | Introduction to Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

A Fast Polynomial Space Algorithm for Subset Sum - Microsoft Research

Subset Sum Problem in C - Shiksha Online

Subset Sum Problem: Dynamic Programming & Recursion Solution | Simplilearn

4 Sum - All Distinct Quadruplets with given Sum in an Array - GeeksforGeeks