C++

Write a recursive solution to solve the Partition problem. Partition: Given a set A of n integers a, a2, ..., an, can you find a subset A1 of integers such that the sum of the integers in A, is half of the sum of all the n integers (that is, Edica, ai =Laien ai)? Input: 1. Number of integers of set A: n 2. nintegers: a1, a2, ..., an. Output: Print out yes if you can find a subset A1 of integers such that the sum of the integers in A1 is half of the sum of all the n integers (that is, Laien, ai = Zaiga @i); otherwise, print out no. Test your program with the following two instances: 1) 5 integers: 5, 10, 6, 8, 1 2) 20 integers: 1,5,7, 34, 76, 54, 23, 19, 22, 81, 44, 77, 29, 40, 11, 42, 43, 31, 57, 61