Time ComplexityO(n log n)Code#include #include using namespace std;void merge(vector& vec, int left, int mid, int right){ int i,j,k; int fIdx = mid - left + 1; int sIdx = right - mid; vector leftVc(fIdx), rightVc(sIdx); for(i=0; i& vec, int left, int right){ if (left