Algorithm analysis

Show that the worst$-$case and average$-$case time complexities for the mumber of sssignments of rocords performed by the Insertion Sart algarithm $($Algorithm $7\mathrm{.}1)$ are given by

$A(n)=\frac{n(n+7)}{4}-1$~~$\frac{n^2}{4}.$