(a) Show that the computational complexity of Bubble Sort in the worst case is O(n2). (b) Consider the Quicksort algorithm. (i) Describe how Quicksort Algorithm would sort a list of n numbers. (ii) Give a condition under which the Quicksort algorithm will perform at its worst. Justify your answer.ALGORITHM BubbleSort (A[0..n1]) //Sorts a given array by bubble sort //Input: An array A[ 0..n1] of orderable elements //Output: Array A[0..n1] sorted in nondecreasing order for i0 to n2 do for j0 to n2i do if A[j+1]<A[j] swap A[j] and A[j+1].

1. (a) Show that the computational complexity of Bubble Sort in the worst case is O(n2). (b) Consider
the Quicksort algorithm. (i) Describe how Quicksort Algorithm would sort a list of n numbers. (ii)
Give a condition under which the Quicksort algorithm will perform at its worst. Justify your
answer.ALGORITHM BubbleSort (A[0..n1]) //Sorts a given array by bubble sort //Input: An array A[
0..n1] of orderable elements //Output: Array A[0..n1] sorted in nondecreasing order for i0 to n2 do
for j0 to n2i do if A[j+1]<A[j] swap A[j] and A[j+1]