Bubble sort is a simple, inefficient sorting algorithm used to sort lists. Use simple language to answer those questions

BubbleSort (30 pts) BubbleSort is a popular but inefficient sorting algorithm. It works by repeatedly swapping adjacent elements that are out of order, and doing so enough times that there can be no more elements out of order. 1: BUBBLESORT(A[1..n]) for i = 1 ton 1 2: for j = n downto i + 1 if A[j]