Problem: Given 20 positive integers as input, calculate the number of divisors for each integer and sort the data set from smallest to largest based on the number of divisors. When multiple integers...

This question has already been answered with the language C++, how would one do this in C instead?

Extracted text: Problem: Given 20 positive integers as input, calculate the number of divisors for each integer and sort the data set from smallest to largest based on the number of divisors. When multiple integers have the same number of divisors then sort them smallest to largest. Examples: Integer value 12 has divisors 1, 2, 3, 4, 6, 12 for a total of 6. Prime numbers only have divisors of 1 and the number itself. The integer 1, the smallest value that will be provided as input, has only a single divisor, itself. Example Execution #1: Enter 20 integer values -> 21 15 10 6 3 1 28 13 57 9 29 31 37 17 19 12 43 24 2 Data sorted by number of divisors: 1 2 3 5 7 13 17 19 29 31 37 43 9 6 10 15 21 12 28 24 Example Execution #2 (data does not have to be unique): Enter 20 integer values -> 9 7 5 3 8 6 4 2 9 7 5 3 86 4 2 9 75 3 Data sorted by number of divisors: 2 2 3 33 5 5577 7 4 4 9 9 6 8 8