3 The Badgervengers (10 points) Varmel Studios is working on a new superhero movie called "The Badgervengers". There will be ss superheroes starring in the movie. Each superhero iS;{1,,s} has a known positive integer combat strength pi. Let m=i=1api be the total combat strength of all of the superheroes. In this film, the superheroes will turn against each other, so the movie producers would like to split them into two tenms of equal size and strength if possible. A team's size is the number of superheroes on the team, and its strength is the sum total of their combat strengths. You can assume that s and m are even. Given the combat strengths of all s superheroes, is it posable to divide S into two teams of equal size and strength, where every superhero appears in exactly one of the teams? 3.1. (3 points) Give a recursive algorithm called SupEnSpLIT that will solve the problem described above. Your recursive algorithm should have 3 parameters: - i - Considering only the first i superheros from S, - jA group size of exactly j. - kA total combat strength of k. SuPERSpLIT will return true, if, out of the first i superheros from S,, there is a group of j superheros with a total combat strength of k