based on this insertion sort algorithm code

do key $<$A$[$j$]$

$$ i$<$j$-1$

while i$>0$and A$[$i$]>$key

$$ do A$[$i$+1]<$A$[$i$]$

$$ i$<$i$-1$

$$A$[$i$+1]=$key

write me the below

$$Report Structure:

o Introduction: Explain the sorting algorithms chosen for optimization.

o Optimization Techniques: Detail the specific optimizations applied, why they were chosen, and how they were implemented.

o Challenges: Discuss any challenges faced during the optimization process.

o Conclusion: Summarize the overall findings, which algorithm performed best under different scenarios, and what was learned from the project.