$1.$ Analyze the operation opB $($below$)$ for its worst case performance by$,$

i$.$ Showing the number of times each statement is executed.

ii$.$ Showing the mathematical function F$($n$)$ for opB

iii. Showing the upper bound $($Big$-$O$)$ of function F$($n$)$

void opB $($IntegerQueue& r$)$

$//!$ restores r

$//!$ ensures: the contents of r is displayed

$\{$

int x$,$ z;

z $=$ r$.$length$()$; $//$ S$1$

for $($int k $=0$; k $<$ z; k$++)\{//$ S$2\mathrm{.}1,$ S$2\mathrm{.}2,$ S$2\mathrm{.}3$

if$($k $==0)\{//$ S$3$

cout $<<"<"$; $//$ S$4$

$\}//$ end if

cout $<<$ r$.$front$()<<$ endl; $//$ S$5$

if $($k $==($z $-1))\{//$ S$6$

cout $<<">"$; $//$ S$7$

$\}//$ end if

r$.$dequeue$($x$)$; $//$ S$8$

r$.$enqueue$($x$)$; $//$ S$9$

$\}//$ end for

$\}//$ opB