Question

in a birthday party, the host decides to gift the guest who wins a game in the party. in the game, the host announces an odd number and asks the participants to find all the maximum sized sumfree subsets. the participants will then add all the elements of the sumfree subsets. a set is a sumfree set if no element of the set is the sum of any other two elements in the set. an element can also be considered twice to get the sum. the participant is declared a winner if he/she tells the correct total sum of the elements of all the maximal sized sumfree sets. he/she will get number of gifts equal to the total sum. write an algorithm to find the maximum number of gifts a participant can win. input 4 the input consists of an integer n, representing the odd number editor 1 2 3- / 4- 6 7 8 import java. 1o.bufferedreaders import java.io.inputstreamreaders import java.util.scanner; public class solution 9- { 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25​

Answer 1

Answer:

Did not understand your question.