need help please

if you can it needs to be in a IEEE format.

The objective of this programming lab is to test the performance of five different sorting algorithms: - Bubble, - Selection, - Insertion, - Merge, and - Quick The purpose is to count the total time that each algorithm took to sort a data. Write a class called Sorting.java, where will process a file containing the numbers. The file: Data.txt is located on the Blackboard and contains integers. In the file Sorting.java, you will process the time elapsed that each algorithm took to sort in increasing order the file Data.txt Test Cases ( 25 pts.) Sort the file with the 5 different algorithms and check the performance. You can use the System. nanotime () to calculate the execution time for each algorithm. In similar fashion, test also in nanoseconds sequential search and binary search for the following cases: 1. 324110 2. 5555 3. -826313 Note: If any of these algorithms for any particular array runs for more than 10 minutes, you can terminate the process and state that in your report. Report (75 pts.) Write a report using the IEEE format (see the template on the Blackboard), explaining the performance of each sorting algorithm and the experiments you performed. You can include graphs showing the performance between the algorithms. In the report, show the Big- 0 notation for each algorithm. Explain why the algorithm owns that complexity. You can also include the run time analysis for each sorting algorithm. NOTE: Notice that most of the points are in the report, therefore I expect a clear, concise and well structured report. I will check the following for the report: 1. Introduction. Here goes the description of the problem you are solving. What is the problem given to you? What is the challenge? What is the task you need to perform? 2. The problem and our solving approach. Here goes the description of the way you plan to address this problem: basically an informal description, along with your algorithms. You have to explain (justify) why your approach actually solves the given problem. 3. Performance of our approach. Here goes the theoretical study of your algorithm, i.e., run time analysis and description of the algorithm complexity (i.e., Big-O) 4. Testing strategy. Describe the test cases that you include for testing your five different algorithms. Enumerate your test cases, e.g., unordered data, sorted data, duplicates, reverse order data. 5. Experiments and Results. Provide the experiments and the results of each experiment. You need to be as detail as possible. Provide tables, graphs, or any kind of ideas to demonstrate the work you did. For this specific lab, you can include the theoretical results (i.e., the run time analysis) and the experimental results (the actual execution time). 6. Conclusion. Summarize your work done in the report, recap everything you learned and justify the results of your experiments. 7. Implementation Annexes In this section you must include your code for your algorithms and your programs including the test cases