Given an array A[0,…,N−1] . Write a function that takes one required argument A and one optional argument erase, which defaults to 1. Return an array B[0,…,N−1] , where Bi=A0+…+Ai is an array of partial sums of array A , after removing from array B, all elements equal to erase. Try to do it in linear time without using Numpy. def cumsum_and_erase(<YOUR CODE>): #YOUR CODE B = #YOUR CODE return B A = [5, 1, 4, 5, 14] B = cumsum_and_erase(A, erase=10) assert B == [5, 6, 15, 29], "Something is wrong! Please try again"

def cumsum_and_erase(A, erase=1):
    #YOUR CODE
    B = [0 for _ in range(len(A))]
    B[0] = A[0]
    for i in range(1,len(A)):
        B[i] = B[i-1] + A[i]
    while erase in B:
        B.remove(erase)
    return B

A = [5, 1, 4, 5, 14]
B = cumsum_and_erase(A, erase=10)

assert B == [5, 6, 15, 29], "Something is wrong! Please try again"