Use Big O Notation to describe the time complexity of the following function. The function returns true if the array is a “100-Sum Array,” and false if it is not. A “100-Sum Array” meets the following...

Use Big O Notation to describe the time complexity of the following function. The function returns true if the array is a “100-Sum Array,” and false if it is not. A “100-Sum Array” meets the following criteria: • Its first and last numbers add up to 100. • Its second and second-to-last numbers add up to 100. • Its third and third-to-last numbers add up to 100, and so on. Here is the function: