Q$22.3\mathrm{.}1)[2$ points$]$ Consider the following C$++$ implementation to answer the next subquestions:

void insertElement $($int new$\_$element, int list$\_$length, vector &vect$)\{$ int indx $=0$;

bool flag;

bool flag $=$ false;

while $(($indx $$ list$\_$length$)$ && $!$ flag$)\{$

if $($new element $>$ vect $[$indx$])\{$

indx$++$; $\}$

else $\{$

flag $=$ true; $\}\}$

for $($int i$=$list$\_$length; i$>$indx; i$--)\{$

vect $[$i$]$

$=$

vect$[$i$-1]$; $\}$

vect $[$indx$]=$ new$\_$element; $\}$

$\}$

Q$22\mathrm{.}1.-$ What does this function do$?[1$ point$]$

Q$22\mathrm{.}2.-$ What is the running time of the best case scenario in terms of big$-$O$?[0\mathrm{.}5$ point$]$

Q$22\mathrm{.}3.-$ What is the running time of the worst case scenario in terms of big$-$O$?[0\mathrm{.}5$ point$]$

Q$22\mathrm{.}4.-$ How can we improve the running time of this function in the worst case scenario? $[1$ bonus point$]$void insertElement$($int new$\_$element, int list$\_$length, vector$=\frac{0}{b}ar(+)++=$