Describe how the number of comparisons used in the worst case changes when the size of the list to be sorted doubles from n to 2n, where n is a positive integer when these sorting algorithms are used.a) bubble sort________________b) insertion sort________________c) selection sort (described in the preamble to Exercise 41 in Section 3.1)________________d) binary insertion sort (described in the preamble to Exercise 47 in Section 3.1)An n × n matrix is called upper triangular if aij = 0 whenever i > j.

Solution:Step 1:We have to check the adjustment in the quantity of correlations utilized as a part of the most pessimistic scenario when the extent of the rundown to be sorted pairs from n to 2n, where n is a positive number when diverse sorting calculations are utilized.