Problem Description:
Write a single program to compare between insertion sort and selection sort.
For a given input array, write separate functions to implement insertion sort and selection sort algorithms and perform the below tasks:
1. The program should output number of comparisons and data movements made by each algorithm
2. The program should show intermediate steps (arrays) of the sorting process by each algorithm.
3. The program should have a mechanism to ask the user to "To continue/auit" the program.
Suppose if user inputs 1, the program should re-run from the beginning asking for another run on a different input. If user inputs 0, the program should stop.
Give the tracing for each algorithm by considering array demonstrating best case (if exists) and worst-case separately.
Write a Java program to implement this task by using separate functions wherever necessary.
Submit a neat report containing all the above (algorithm time complexity+ tracing +Program).