5) Consider the following sort algorithm Step 1: If there are no numbers or only I number to sort, then stop Step 2: Otherwise, split the array MI.into 2 sub-arrays, one with the size n 17 and the other with the size 6n/7 Step 3: Sort the sub-array at left Step 4: Solve the sub-array at right Step 5: Merge both sub-arrays Step 6 Return to Step a) What is the time T of each step (as a function of n)? Step I Step 2 Step 3. Step 4 Step 5 Step 6