Write a Java program to randomly generate the following sets of data:

1. 10 numbers

2. 1,000 numbers

3. 100,000 numbers

4. 1,000,000 numbers

5. 10,000,000 numbers

Each number generated must be a four-digit number. Your program must sort the above sets of numbers using the following algorithms:

a) Insertion Sort

b) Heap Sort

c) Randomized Quick Sort

Print out the time each algorithm takes to sort the above numbers. Your program needs to produce the following output:

Insertion Sort:

1. 10 numbers:

Data Generated:

Sorted Data:

Time:

2. 1,000 numbers, time:

3. 100,000 numbers, time:

4. 1,000,000 numbers, time:

5. 10,000,000 numbers, time:

Heap Sort:

1. 10 numbers:

Data Generated:

Sorted Data:

Time:

2. 1,000 numbers, time:

3. 100,000 numbers, time:

4. 1,000,000 numbers, time:

5. 10,000,000 numbers, time:

Randomized Quick Sort:

1. 10 numbers:

Data Generated:

Sorted Data: Time:

2. 1,000 numbers, time:

3. 100,000 numbers, time:

4. 1,000,000 numbers, time:

5. 10,000,000 numbers, time: