in C++

complete all tasks

Problem Introduction The goal of this experiment is to gain experience in working with two sorting algorithms "Selection Sort and Merge Sort" and analyzing their time complexities and comparing them to one another. Tasks - Write a program that takes a list and sorts it using Selection Sort. - Write a program that takes a list and sorts it using Merge sort with recursion. - Compare the execution time for the following three conditions: 1. The list is sorted 2. The list is half sorted 3. The list is reverses - Analyze and discuss the time complexity for cases 3.a-3.c. - Analyze and discuss the time complexity of the two methods