Answer:
Please see below
Explanation:
The relevant algorithm has been attached as images herein as part a and part b. There are 2 important steps in solving this query.
First, you need to acquire a sum value of the array. For an odd sum, the output will come out as false since there cannot be 2 subsets whose sums are equivalent to each other.
Second, in case of an even sum, acquire sum divided by two and locate a subset of the array that has an equivalent sum to this (use recursion or dynamic programming).
