Analyze the following code and determine its approximate running time and worst-case time complexity. Show all step counts. Give Big-Oh of the time complexity T(n) and prove it. step Code counts N W def bubble_sort(data): swapped = True while swapped: swapped = False for i in range(len(data)-1): if data[i] >data[i+1]: data[i], data[i+1] = data[i+1], data[i] 600 swapped = True