Please explain each step in detail, thanks!

4. (a) [6 marks] I have written an amazing new sorting algorithm called stupidSwapSort () which sorts an array of n elements that have a total order. Below is the pseudocode for my sorting algorithm. Note that my algorithm does the two operations I have highlighted with a red rectangle every iteration no matter what the input. Count the runtime of my algorithm, T(n), by counting the number of times those two commands occur. (b) [2 marks] Based on my algorithm above you can see that the big-oh runtime in both the worst-case and best-case is the same. But, there is a best-case scenario in which my algorithm never performs the first swap command, swap(A[j],A[k]). Describe the input distribution in such a scenario, you may use an example