Consider the following vector:

$1$

What is the minimum number of passes required to implement the Bubble Sort algorithm on this vector? The final pass can be the pass where no

more swaps are required.Consider the following sequence of vectors, where each vector is on a separate line:

In each line we should have the vector after the values have been shifted according to the Insertion Sort algorithm. What values should go in the

third line?Consider the following piece of JavaScript:

varn$=5$;

var sum $=2$;

for $($var $=2**logi=0$;$i$

sum $=2**$ sum;