a) States From problem statement, we find 3 variables: array size, k and target. So it is 3D DP: dp[i][j][t]: in previous i elements, we pick j of them, to reach value t - number of results b) Selection Strategy Usually for 1D array, selection strategy is very simple: with ...