The quicksort in the text uses two recursive calls. Remove one of the calls as follows. a. Rewrite the code so that the second recursive call is unconditionally the last line in quicksort. Do so by...

The quicksort in the text uses two recursive calls. Remove one of the calls as follows.

a. Rewrite the code so that the second recursive call is unconditionally the last line in quicksort. Do so by reversing the if/else, and returning after the call to insertionSort.

 b. Remove the tail recursion by writing a while loop and altering low.