Use Python ti solve this simple coding problem, thanks

Description: Create a function to find the index of an array of positive integers (index start at 0 ) where the difference of the sum of elements on either side of the index are as close to zero as possible. If there are multiple indexes that tie, return the smallest index. The test cases are checking for both correctness and time complexity. Examples: Explanation: Indexes 1,2,3, and 4 all have equal sums to the left and right, so we return 1 because it's the smallest. Language Python 3 Q Autoc