Program is to be written in C++

different scenarios. Task 1: Write a function named "selection" that takes a list and sorts it using Selection Sort. Task 2: Write a function named "bubble" that takes a list and sorts it using Bubble Sort. Task 3: Write a main program that calls these two functions and compares the execution time for the following three conditions: A. The input list is sorted B. The input list is half sorted C. The input list is reversed Task 4: Analyze the theoretical time complexity of selection and bubble sorts and map them to the findings of Task 3. Output Instructions The output screen would prompt the user to enter a list and then, perform the sorts with their execution times. Submission: Submit the report sheet and the source files to Canvas. Tasks 3 and 4 should be clearly discussed in the report. The solution must be written in C++. No compression (e.g. zip, rar, etc.) is allowed. All files should be submitted separately