Hello. Would someone please help me with this question? I need to figure out how to do the following:

a) Give the worst-case running time of BubbleSort, in big-O notation. Please give me all the steps so I can understand. b) Give the best-case running time of BubbleSort, in big-O notation, with justification. Please give me all the steps, so I can understand. I'm confused how to calculate the total costs of the iterations, like the n values, etc. Where do you start so that you end up with BigO(n) or Big0(n²)? From my understanding, they are both (best/worst cases) - does that sound right? How do you arrive at that? Steps would be really helpful. Please use this pseudocode as reference for this problem.

Thank you so much!

(n2) Bubblesort pseudo code 1. for k - 1 to A.length - 1 2. forj A.length downto k+1 3. 4. swap Alil with Ari-11