Given an arrayA [10, 13, 20, 25, 32]that will be sorted intodescendingorder. Use improved Bubble Sort and Insertion Sortto sort array A. In the table below, show the results for each pass and give the total number of comparisons and exchanges.

	[0]	[1]	[2]	[3]	[4]
A	10	13	20	25	32

Improved Bubble Sort Total Total Swap Comparison After Pass 1 After Pass 2 After Pass 3 After Pass 4Insertion Sort Total Total Insert Comparison After Pass 1 After Pass 2 After Pass 3 After Pass 4mproved Bubble Sort Insertion Sort Pass Number of Pass Number of Comparison Comparison 2 2 3 3 4 4 Total Total Compares Compares