-PLEASE INSTRUCTION FOR QUESTION

- WALK ME TROUGH ALL THE CALCULATION AND DON'T SEND ME INCORRECT OR INCOMPLETE ANSWER

- IF YOU COPY ANSWER FROM INTERNET I WIL MARK YOU DOWN

1. analyze the time complexity of the bubble sort algorithm STEP BY STEP . Then specify the worst-case time complexity of bubble sort in Big-O notation.You need to shows count all the basic operatiation and show how get to answers. for example c1 =0 , c2= n+1, c3= n => fn=(C2+C3)*n+C1=(O)n void bubblesort( int arr[], int size){ for (int i= 0; ifor (int j=0; jif (arr[j]> arr[j+1]){ int temp= arr[j] ; arr[j]= arr[j+1]; arr[j+1]= temp; } } } }