1. Objective Your goal is to solve the maximum sum descent problem. 2. Problem You are given a triangular-shaped pile of integers in a file. There may be anywhere from 1 to 100 rows in the triangle. Your task is to find the maximum total from the top to the bottom, outputting the total as well as the values that comprise that total. For the triangle below, the numbers in red are on the maximal path. 75 95 64 17 42 82 18 35 87 10 The max sum is 7564 82 87, which is 308. The program takes in a single command line argument, which is the name of the file containing the integers. All integers are guaranteed to be no more than 2 digits, so the sum will definitely fit into an integer. The output will look as follows for a given execution. First the table is displayed, then the max sum is displayed, followed by the values that comprise that sum. See below: 1. Objective Your goal is to solve the maximum sum descent problem. 2. Problem You are given a triangular-shaped pile of integers in a file. There may be anywhere from 1 to 100 rows in the triangle. Your task is to find the maximum total from the top to the bottom, outputting the total as well as the values that comprise that total. For the triangle below, the numbers in red are on the maximal path. 75 95 64 17 42 82 18 35 87 10 The max sum is 7564 82 87, which is 308. The program takes in a single command line argument, which is the name of the file containing the integers. All integers are guaranteed to be no more than 2 digits, so the sum will definitely fit into an integer. The output will look as follows for a given execution. First the table is displayed, then the max sum is displayed, followed by the values that comprise that sum. See below