Cоnsider the subset sum prоblem. Given аn аrrаy A оf non-negative integers of size n and a value sum, S, the task is to check if there is a subset of the given array whose sum is equal to S. There exists a solution using Dynamic Programming with O(nS) subproblems and an O(nS) runtime. Which of the following is true: