Hi, I need help with this Big-O analysis. It's C++, but it is to be done with pencil and paper, no code at all. Problems 5, 7, 8 are the only ones needing completed. Thank you.

1.3 Algorithm Efficiency-The Search Problem . . 29 successor. If the two values are not in the proper order relative to each other, they are swapped. The array will be completely sorted when no swaps are made during a pass. Write a C++ version of this algorithm. Then subject your algorithm to a big-O efficiency analysis as we did for the selection and insertion sorts. Compare bubble sort's best, average, and worst case performance to those of the other two algorithms. 5. Do a big-O analysis for those statements inside each of the following nested loop constructs. a. for (k = 0; k 0) do 1 2 // integer division while (y > 0) --Y c. = 1; x = 21 while (x