The main objective of this lab is to study and analyze merge sort and its time complexity in different scenarios. Task 1: Write a program that performs recursive merge sort 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 2: Analyze the theoretical time complexity of merge sort and justify your findings from Task 1. Task 3 (Extra Credit): Perform tasks 1 and 2 for iterative merge sort. Output Instructions The output screen would prompt the user to enter the number of elements and scenario A/B/C (see Task 1). The program would select the elements based on the desired scenario. Submission: Submit the report sheet and the source files to Canvas. The solution must be written in C++. No compression (e.g. zip, rar, etc.) is allowed. All files should be submitted separately