QUESTION 2 (30 minutes: solution by 5.00pm) Based on Question 1, create a program that calculate the following; The name of day with the highest total amount of sales. The salesman info with the highest total amount of sales. If there are more than one salesman or day with same highest value, choose the earliest one. Input format: First line is an integer N, represents the number of salesman. Followed by N lines, where each line contain 5 working day sales information. Output format: First line is: the name of day with the highest total amount. Second line is the salesman info with the highest total amount. Example of input and output: Output Friday Salesman 2 Input 5 146.16 87.13 105.53 63.76 202.69 119.63 484.84 205.62 413.55 300.65 87.89 135.04 271.87 35.67 266.39 457.14 113.36 290.84 274.01 310.19 389.56 301.10 192.06 137.68 331.78