6. a) Write a program that implements a slow [O(n²)] sort method and a fast [O(nlogn)] sort method. Experiment with your program by running your sort methods using n random numbers as inputs for n=1000, n=10000, n=100000.

Compare the running times by implementing the timer function of the language you are using.