$($a$)$ Sort the array $A=[20,18,27,10,68,80,91,45]$ by using insertion sort

$($b$)$ What is the best case for insertion sort, what is its best time complexity $($best running time$)?$

$($c$)$ What is worst case for insertion sort, what is it its worst time complexity$($worst running time$)?$