Pseudo-polynomial Partition Given a set consisting of n integers [a₁, a₂, a_n], you want to partition into two parts so that the sum of the two parts is equal. Suppose s = a₁ + a₂ + a_n. The time complexity of your algorithm should be O(ns) or better. [Note: Due to the presence of the term s in the time complexity, such an algorithm is called pseudo polynomial algorithm.]

Please use python or C++ to do the program