2. Given three different sorting algorithms to solve a sorting problem and their runtimes are expressed as given below: T₁(N) = O(N²) T₂(N) = e(N²) T₂(N) = Q(N²) Which algorithm should be preferred and which one should not be. Give your answer by using the definitions of the three symbols used.

There are various sorting algorithms available to sort data of different sizes. Three of these algorithms are Bubble sort, Shell sort, and Quicksort. In Python, write a program to generate random integer numbers of multiple sizes; 10000, 30000, 40000, 50000, and 70000, and find out which of these sorting algorithms perform the fastest sorting technique. Provide data to prove and support your findings or results by plotting a graph showing the time each takes to sort data of various sizes. It should be written in a single program. Write the code in python and also show the graphical result. Also do the proper identation of the code.

coding