[Computer Science / Python Algorithm Question]

I need help in Computer Science for Python Algorithm. If you need more information, pleas let me know. Thank you for your time.

[Array, Stack, and Queue]

The solution has the complexity below

• Complexity:
  • (2) time
  • (2) space

Output should look like this,

# Implementation def fun_22(arr): Find the largest sum across all the contiguous (non-empty) subarrays of the input array You may assume the input array is not empty You may not assume there is exactly one subarray (that has the largest sum) Parameters arr : a list of integers Returns [the largest sum, the list of all the possible [index of the first element, index of the last element]] : a list of two items, where the first item is an integer and the second item is a list of list # Implement me (45 marks) # Test arr_1 = [2] arr_2 [-2, 3] arr_3 [-2, 3, -2, 4, -1, -2] arr_4 = [-2, 3, -2, 4, -1, -2, -10, 5] print(fun_22(arr_1)) print(fun_22(arr_2)) print(fun_22(arr_3)) print(fun_22(arr_4)) [2, [[0, 0]]] [3, [[1, 1]]] [5, [[1, 3]]] [5, [[1, 3], [7, 7]]]