1. Explain how Bubble Sort works with an example array: Int a [23,45,59,66,68,12] 2. Write a Working code of Bubble Sort in C++. Requirements: I. Size of the array is decided by the user li. The elements in the array are input by the user. lii. Print the result of each pass of the algorithm, to highlight all the steps. 3. Analyse the best case and worst-case performance of Bubble sort and find its Big O. 4. Optimizing Bubble Sort: Find a way to reduce the number of passes and end the program if the array gets sorted before all passes are finished. Write the code in C++ for the modified Bubble Sort