Sorting - General Questions

How many comparisons does bubble sort make in the worst case on 5 elements (without early exit)?

Which sort makes the minimum number of swaps?

Insertion sort's best case (already sorted input) is:

Quick sort's average time complexity is:

Which sort is stable and works well on nearly sorted data?