在对长度为 $n$（$n\ge 1$）的数组进行归并排序的过程中，mergeArray 函数（合并两个有序子数组的操作）

被调用的次数是（ ）。

1const int MAXN = 100005;2 3int a[MAXN];4int tempArr[MAXN];5 6void mergeArray(int left, int mid, int right) {7   int i = left; // 左半部分起点8   int j = mid + 1; // 右半部分起点9   int k = left; // 临时数组下标10 11   while (i <= mid && j <= right) {12      if (a[i] <= a[j]) {13        tempArr[k++] = a[i++];14      } else {15        tempArr[k++] = a[j++];16      }17   }18 19   while (i <= mid) {20      tempArr[k++] = a[i++];21   }22 23   while (j <= right) {24      tempArr[k++] = a[j++];25   }26 27   for (int p = left; p <= right; p++) {28      a[p] = tempArr[p];29   }30}31 32void mergeSort(int left, int right) {33   if (left >= right) {34      return;35   }36 37   int mid = left + (right - left) / 2;38 39   mergeSort(left, mid);40   mergeSort(mid + 1, right);41 42   mergeArray(left, mid, right);43}