Suppose elements in array A are already sorted ascending order of their values when the code begins to run, then execution time of the code will be （）。（）A. O(log2n) B. O(n) C. O(nlog2n) D. O(n2)