Task $1(80$ pts$).$ Implement the Insertion Sort algorithm as discussed in

Lecture $1.($Hint: use the function checked sorted to check if your output

is indeed sorted.$)$

$$ Task $2(20$ pts$).$ Generate a report to discuss the time performance of

the algorithm. Compare it with their theoretical time complexity as dis$-$

cussed in the lecture. Plots and figures are encouraged to help draw the

conclusion.

Figure $1$: An example of the time performance plot