Haskell code please comment every step!

1. Use pattern matching and recursion in order to define a function merge :: [Int] -> [Int] -> [Int] that merges two ordered list so that the result is also ordered Example: merge [1,2,61 (3,7,8][1,2,3,6,7,8] Write a program that computes the greatest common divisor of two numbers x and y using the Euclidean algorithm. The Euclidean algorithm is defined as follows: if x = y, then return x (or y), otherwise gcdea(x, y) = gcdea(x-y, y)where x > y. 2. 3. Define a recursive function qsort : Ord a [a]a] that implements quicksort, which can be specified by the following two rules: a. The empty list is already sorted; b. Non-empty lists can be sorted by sorting the tail values 3 the head, sorting the tail values > the head, and then appending the resulting lists on either side of the head value 4. Apply filter to solve quicksort problem, with qsort' :: ord a [a] > [a] 5. How would you define the sum of the squares of the natural numbers 1 to n using map and foldr? (sumSquares' :: Integer -Integer)