Task 2: Sorting Implementation - Implement merge sort, and quick sort to sort a list of integers. The

code for these algorithms can be obtained from the internet (e.g., http://www.geeksforgeeks.org).

However, detail remarks (comments) by using your own words are required to be provided in the code

to show your understanding of the code. Each function must be accompanied by comments.* Extra

mark will be given if you implement additional sorting algorithms (e.g., shell sort ,insertion sort etc for

this task).