ow to attempt? Ruestion: he Card Game One day, Fred and his N friends were playing a card game in which each player throws a ard with a number written on it. The cards are such that a number X is written on front of ne card, and the negative of thal number is written on the back side of the card. This ame has the following rules: - Each of Ihe N players is asked to throw a card. After all the N cards are thrown, Fred has flip one or more cards in consecutive order, only once. our lask is to help Fred flip the cards in such a way that the sum of the numbers, on ront face of the cards, is the maximym. mput Specification: Input1: An integer N denoting the number of cards (1 <= N <= 500) Input2: An integer array containingN integers, where the ith integer denotes the value on the front of the card (-1000 <= input2[1)<= 1000) Dutput Specification: Return the maximum sum of the numbers, on the front of the cards