Implement in-place quick sort and Modified quicksort which has: 1. Use median-of-three as pivot. 2. For small subproblem size ( ), you must use insertion sort.

code in Java and run these algorithms for different input sizes. (e.g. = 500, 1000, 2000, 4000, 5000, 10000, 20000, 30000, 40000 and 50,000). You will randomly generate numbers for your input array. Record the execution time.