Given the recursive bubble sort algorithm, analyze its time complexity in terms of Big O.

bubbleSort(A[], n) { // Base case if (n == 1) return; // One pass of bubble sort. After // this pass, the largest element // is moved (or bubbled) to end. for (i=0; i;> if (A[i] > A[i+1]) swap(A[i], A[i+1]); // Largest element is fixed, // recur for remaining array bubbleSort(A, n-1); }