We have integer values that you can keep (array, list, etc.) in the data structure you want. You can think that the maximum number is 100, and you can generate this data by generating random numbers. We want to sort this data using three different algorithms, in other words, we want to have the chance to choose the algorithm we want at runtime. These three algorithms are "BubbleSort", "QuickSort (you can type recursive)" and "InsertionSort". Perform this application using the appropriate design pattern. In the design pattern (client) you will use, show the application of all three algorithms for experimental purposes (you can print the data sequentially after each application) and also measure the runtime for each sorting algorithm.