1) For the following question, how will the array elements look like after second pass of Insertion sort? 34, 8, 64, 51, 32, 21

8, 21, 32, 34, 51, 64

8, 32, 34, 51, 64, 21

8, 34, 51, 64, 32, 21

8, 34, 64, 51, 32, 21

2)

What is the disadvantage of selection sort?

It requires auxiliary memory

It is not scalable

It can be used for small keys

It takes linear time to sort the elements

3)

Which of the following is an advantage of optimized bubble sort over other sorting techniques in case of sorted elements?

Detects whether the input is already sorted

Consumes less memory

It is faster

Consumes less time

4)

What is the auxiliary space complexity of merge sort?

O(n log n)

O(n)

O(log n)

O(1)