Description

Write a bubble sort program that prints the number of swaps made at the end of M number of iterations $($In this case, $$M$$ should be an input value from user$).$

For example, if M $=0,$ the bubble sort program will perform $0$ swaps in $0$ iterations.

In bubble sort, an iteration is defined as the total number of times the outer loop runs. Assume that:

$1)$ M $<=$ the list size and

$2)$ the program sorts in descending order.

The code should ask the user to input the values for M$,$ and the elements of the array.

Input line $1$: The value of M

Input line $2$: A list of integers