3. Imagine a discrete function f(x) defined over the interval [0,n], where n denotes a positive integer. This function f(x) spans the range of positive and negative values within this interval. Your objective is to devise a decrease and conquer algorithm to pinpoint the subsequent interval that results in the largest total area under the function f(x). Notably, this total area encompasses both positive and negative values. Negative values within the function will diminish the total area, impacting the overall calculation of the maximal area under the curve. Develop an algorithm utilizing the decrease and conquer strategy to efficiently identify the interval within [0,n] that produces the maximal total area under the discrete function f(x), considering the effects of both positive and negative values on the overall area calculation. Provide the pseudo code and analyze the time complexity (Big-Oh notation) of your proposed algorithm. Example: The area between [3,5] is =2+(2)+1=1. The maximum total area is [0,3]=2+1+2=5