Create three functions: Insertion_Sort, Selection_Sort, and Merge_Sort, each takes a list and implement the corresponding sorting algorithm using the list as if it is an array. Also create a function populate that takes a list and an integer as size as inputs and populates the list with size number of randomly generated integers from -2,000,000 to +2,000,000. Note that size should not be bigger than 1,000,000. Also write the fifth function names isSorted which takes a list (using it as an array) and return True if the array is sorted and False otherwise.

The steps are

1. Call the populate function to populate the array

2. Make a copy of your array

3. Call one sorting algorithm

4. Call isSorted to make sure the array is sorted