Answer:

The overall complexity of Bubble sort 1 in both best and worst cases is O(n^2)

The overall best-case complexity of Bubble sort 2 is O(n) and its worst case complexity is O(n^2) where n is the length of the list.

Feedback: Would be good to define what n actually is for Bubble Sort 1:

The overall complexity of Bubble sort 1 in both best and worst cases is O(n^2), where n is the number of elements in the list