Please solve this assginment using JAVA. And test it is working using Netbeans

1.Implement Insertion Sort, Quicksort, and Timsort.

2. Test your algorithms on di erently sized lists or arrays of integers. A good test will have many data points of varying magnitudes. For example, a decent test might test lists that have sizes that are powers of 10s (10, 100, 1000, 10000 . . . ), but don't be afraid to add more data points. Output your data to a le. It may be useful for you to output your data into a .csv le if you plan on using Excel in the next portion.

3. Your objective is to present your data in such a way that a non-programmer can tell which algorithms perform better. We will give you a fair amount of freedom here. Some options include: - A well formatted table. - Graphing your data (using a program such as Excel).