Please write a C language program, which includes bubble sort, insertion sort, quicksort, merge sort. When inputting an array, you must have the value of output, and compare the execution time of each sort method, and sort from small to large.

example: input: 12 1 24 25 123

output: Sorted list: 1 12 24 25 123 time of bubble sort: time of insertion sort: time of quick sort: time of merge sort: Compare execution time (sorted from smallest to largest):