Mini Assignment 2 (Due March8th) Assume that the brightness of an image is given by a series of pixels. The brightness of the pixels are given with respect to a base level, and is given by an integer, which can be positive, negative or zero. These numbers are arranged in an array. Find the brightest area of the image, that is the region of the array where the sum of the consecutive pixel values is the largest. Example; A 2-5 3 40-15 8-9 1]; The region with the highest sum, brightest pixels would Propose an algorithm for find out out the brightest region. Submit a well comment pseudocode Grading scheme: (your grade will be based on which ever class your algorithm falls in) . For algorithms with complexity 0(n*) or higher (4 pts) . For algorithms with complexity O(n2), where k is the number of digits of n (6 pts) . For algorithms with complexity O(nlogn), where k is the number of digits of n (8 pts) . For algorithms with complexity O(n), where k is the number of digits of n (10 pts) be [3 4 0-1 5 8]. along with an example of the algorithm works