Consider an array \(A\) of integers of size \(n\). The indices of \(A\) run from \(1\) to \(n\). An algorithm is to be designed to check whether \(A\) satisfies the condition given below.
\[ \forall i,j\in\{1,\ldots,n-1\}\ \text{such that}\ i>j,\ (A[i+1]-A[i])>(A[j+1]-A[j]) \]
Which one of the following gives the worst case time complexity of the fastest algorithm that can be designed for the problem?