$5.(10\%)$ Select your answer from A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ and G for each blank in the following

statements.

A$.$ selectionSort B$.$ bubbleSort C$.$ shortBubble D$.$ insertionSort

E$.$ mergeSort F$.$ quickSort G$.$ heapSort

$(1)\_\_\_\_\_\_\_\_\_\_$s Big$-$O complexity is O$($N$)$ for Best case.

$(2)\_\_\_\_\_\_\_\_\_\_$ recognize$($s$)$ if the values are already sorted.

$(3)\_\_\_\_\_\_\_\_\_\_$ is $($are$)$ inherently unstable.

$(4)\_\_\_\_\_\_\_\_\_\_$s Big$-$O complexity is always O$($N$2)$ for Best case, Average case, and Worst

case.

$(5)\_\_\_\_\_\_\_\_\_\_$s Big$-$O complexity is always O$($log$2$N$)$ for Best case, Average case, and Worst

case.