Design, code, and test a C program that uses dynamic programming to determine two separate subsequences of the input such that the first subsequence sums to the first target value and the second subsequence sums to the second target value. The input should be read from standard input (which will be one of (1) keyboard typing, (2) a shell redirect (<) from a file, or (3) cut - and - paste. Do NOT prompt for a file name!
The first line of the input will give n , the length of the sequence , along with the two target values . Each of the remaining input lines will include one sequence value. All values will be positive integers. Your program should echo the target values and the input sequence. If a problem instance has a solution, each of the two subsequences should be output and clearly labeled. A message should be provided for instances without a solution.
Getting Started:
1. Unlike the one-dimensional situation for ordinary subset sums, this problem is two-dimensional.
2. Dynamic programming is the only acceptable method for doing this lab.