Q$5(20$ points$)$: Big$-$O Notation

Consider the following algorithm $($pseudocode$-$like$).$ Regardless of what it docs, show in details how you conduct performance analyze to determine best case scenario function, worst case scenario function, and average performance function $E(n).$ The algorithm performance is characterized$/$measured by assignment statements, print statements, comparisons, and swaps. Note that a call to function SWAP is counted $1$ operation. Finally, from determine Order of Magnitude $($Big$-$O$).$ Giving only the final Big$-$O answer receives no points, show how you count operations.

Q$5(20$ points$)$: Big$-$O Notation

Consider the following algorithm $($pseudocode$-$like$).$ Regardless of what it docs, show in details how you conduct performance analyze to determine best case scenario function, worst case scenario function, and average performance function $E(n).$ The algorithm performance is characterized$/$measured by assignment statements, print statements, comparisons, and swaps. Note that a call to function SWAP is counted $1$ operation. Finally, from determine Order of Magnitude $($Big$-$O$).$ Giving only the final Big$-$O answer receives no points, show how you count operations.