Consider the subset sum problem. Problem: Given an array of numbers find if there is a subset that adds to a given number. Return True if there exists such subset. else return False. The subset of numbers need not be continuous in the array. We don't know anything about the order of the elements in the array. Identify which of the following strategies can be used to solve this problem. Dynamic Programming: Backtracking: Brute force Approach: Divide and Conquer