Implement Selection Sort, Insertion Sort and Bubble Sort for different input sizes. $($E$.$g n $=100,1000,10000,100000.$ Adjust the input size as per your system capacity$)$

Generate graphs comparing input sizes vs time for the following cases:

Case $1$: Arrays with random values

Case $2$: Arrays with sorted values

Case $3$: Arrays with $90\%$ sorted values; permute $10\%$ of the elements $-$ select randomly $10\%$ of elements and swap these elements for permutation

Case $4$: Arrays with $50\%$ sorted elements

Compare all three sorting techniques for under the same figure for the different cases. Provide your interpretations for each case.