$(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)\text{'}$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)\text{'}$s Big$-$O complexity is always $O(N^2)$ for Best case, Average case, and Worst case.

$(5)\text{'}$s Big$-$O complexity is always $O(lo{g}_2(N))$ for Best case, Average case, and Worst case.