The simple internal sorts, insertion, selection, and bubble all run in time proportional to sup(N,2), where N is the number of items to be sorted. Suppose that the array can be split in half, with everything in the left half ordered below everything in the right half. If you estimate that K is the constant of proportionality for both the splitting and the sorting, then splitting and sorting will take Kbracket[ss](N+frac(1,2)sup(N,2)). After the first split, there will be two segments that each have frac(N,2) elements. After the second split, there will be four segments with frac(N,4) elements each. If N is 10, how many split steps are required so that all segments are size 1? 3 2 4 6