What is the time complexity of the above dynamic programming implementation of the balanced partition problem where “n” is the number of elements and “sum” is their sum?$

• A. O(sum)
• B. O(n)
• C. O(sum * n)
• D. O(sum + n)