consider this bubble sort algorithm

for i <- 0 to n - 2 do

for j <- 0 to n - 2 - i do

if A[j + 1] < A[j] swap A[j] and A[j + 1]

(a) Identify the basic operations in this algorithm.

(b) Calculate the number of basic operations.