Python!

Design an exhaustive search or optimization algorithm that solves the problem; describe your algorithm with clear pseudocode, and prove the time efficiency class of your algorithm.

1)

def subsetSum(X, k):

input: a list X of n distinct integers, and a target integer k output: a subset SSX such that k = rest, or None if no such S exists