Develop a program in C language with the ordering algorithms: selection sort, insertion sort, and merge sort. Each one is a function that receives as a parameter the array of numbers to order. The array of numbers must be dynamic and must be filled with numbers. random. It measures the execution time that each algorithm takes to order (not the creation and freeing array memory, not filling in random data). Test your algorithms with arrays of sizes: 10, 100, 1000. Show in a table the execution time that each algorithm took with these sizes of arrangements and also graph the results.