Write Kadane's Algorithm Algo's Objective: Maximum Sum of Contiguous Subarray

I need the algorithm, proof of correctness and runtime analysis for the problem. No code necessary ONLY algorithm. And runtime should be O(n^2).

Q3. Compute the distance vector tables for each node, until they reach a settled state. Present your tables in the style used in the example and shown below, with each iteration appearing in a separate column. [15 marks] Iteration 1 Iteration 2 and so on... cost to Node Node А в с A A C A A 6 A 00 B 00 C 00 00 Node Node A B C D A C D B B A A 00 B 6 1 3 C D I and so on... 8 3. 8 8

READ AND SOLVE VERY CAREFULLY WITH PYTHONthanks in advance Given a jungle matrix N*M:jungle = [[1, 0, 0, 0],[1, 1, 0, 1],[0, 1, 0, 0],[1, 1, 1, 1,]]Where 0 means the block is dead end and 1 means the block can be used in the path from source to destination. Task: (Use Python)Starting at position (0, 0), the goal is to reach position (N-1, M-1).Your program needs to build and output the solution matrix, a 4*4 matrix with 1’s in positions used to get from the starting position (0,0) to the ending position (N-1, M-1) with the following constraints:- You can only move one space at a time.- You can only move in two directions: forward and down.- You can only pass thru spaces on the jungle matrix marked ‘1’If you cannot reach the ending position, print a message that you’re trapped in the jungle Algorithm:If destination is reached          print the solution matrixElse          Mark current cell in the solution matrix          Move forward horizontally and recursively check if this leads to…