The subset-sum problem is defined as follows. Given a set of n
positive integers, S = {a1, a2, a3, ..., an} and positive integer
W, is there a subset of S whose elements sum to W? Design a dynamic
program to solve the problem. (Hint: uses a 2-dimensional Boolean
array X, with n rows and W+1 columns, i.e., X[i, j] = 1,1 <= i
<= n, 0 <= j <= W, if and only if there is a subset of...