Implement and compare the following sorting algorithm :

Mergesort

$$Heapsort

Quicksort $($Regular quick sort$*$ and quick sort using $3$ medians$)$

Insertion sort

Selection sort

Bubble sort

$*$ For regular quick sort you can decide between choosing first, last or a random element as pivot. But you need to include both regular and $3$ medians as separate algorithms. Bonus $(10$ points$)$: Implement a GUI for your program which allows the user to:

Select an algorithm$$

Enter the input size for selected algorithms and see the run time $($in seconds or$$milliseconds$...)$

Compare two or more $($For the $4$th project, maximum is $2)$ algorithms and see the difference in running times $($in seconds or milliseconds...$).$