Given an integer array nums with n 2 elements, you need to figure out if you can partition the array into two subsets such that the sum of the elements in both subsets is equal. Return the partition is it possible, otherwise return false. (a) [18 POINTS] Write SRT BOT for this problem. (b) [12 POINTS] Implement top-down (recursive) dynamic program that solves this problem. (c) [12 POINTS] Implement bottom-up (iterative) dynamic program that solves this problem. Example 1. INPUT: nums [1, 4, 3, 12, 19, 21, 22] OUTPUT: [[1, 19, 21], [3, 4, 12, 22]] EXPLANATION: The array can be partitioned as [1, 19, 21] and [3, 4, 12, 22] Example 2. INPUT: nums [1,2,3,5] OUTPUT: False EXPLANATION: The array cannot be partitioned into equal sum subsets