What is the big O notation for SPACE complexity of the following code (assume all variables have be declared with some initial values): private void sort_helper(T a[]. int k. int n) { while (k*2 + 1 = 0;i--) { sort_helper(bagjtems, i. this.num_items): } while (N-1 > 0) { T temp = bag_items[N-1]: bag_items[N-1] = bag_items[0]: bag_items[0] = temp: sort_helper (bag_items, 0, N-1): N--: } } O (n) O (1) O (n Ig n) O (n^2)