Consider the following code and answer the below questions

def bubbleSort(alist):

for passnum in range(len(alist)-1,0,-1):

for i in range(passnum):

if alist[i]>alist[i+1]:

temp = alist[i]

alist[i] = alist[i+1]

alist[i+1] = temp

alist = [35, 25, 42, 15, 38, 30, 50]

bubbleSort(alist)

print(alist)

a) What are the best, and worst case complexities of the Bubble-Sort algorithm?

b) Explain why the complexity of the best case will be as similar as the worst case in the above implementation even if the input list is already ordered.

c) List two disadvantage of the bubble-sort algorithm.

d) Write down the output of this code after 2 iterations.