What is the time complexity of the following algorithm, assuming that each stack operation takes O(1) time? Input integer array A of size n create empty stack S push A[O] onto S for i=1...n-1 do 1 if A[i] >= A[i-1] then push A[i] onto S else t=0 while S is not empty do t= t + pop(S) end while push t onto S end if end for O a. O(n) O b. O(21) O c. O(n3) O d. O(n log n) Oe. O(n)