Problem 5. Maximum Subarray (10 points)Given an array of n n…

Problem 5. Maximum Subarray (10 points)Given an array of n numbers, give a divide-and-conquer algorithm that finds the subarray that has themaximum sum and returns its sum. For example, Input: arr[] = [2, 3, -8, 7, -1, 2, 3] Output: 11. Explanation:The subarray [7, -1, 2, 3] has the largest sum 11.

A 55-year-old patient presents to the clinic with worsening…

A 55-year-old patient presents to the clinic with worsening vision and difficulty adjusting to dark rooms over the past several years. On physical exam, there was no significant pain, and the optic disc shows cupping. You believe the patient has ____ and that you should refer to ____.