Haskell Define a recursive function "merge :: Ord a => [a] -> [a] -> [a]" that merges two sorted lists to give a single sorted list. For example: > merge [2,5,6] [1,3,4] [1,2,3,4,5,6] Note: your definition should not use other functions on sorted lists such as "insert" or "isort", but should be defined using explicit recursion

def reverse_list (1st: List [Any], start: int, end: int) -> None: """Reverse the order of the items in list , between the indexes and (including the item at the index). If start or end are out of the list bounds, then raise an IndexError. The function must be implemented **recursively**. >>> lst ['2', '2', 'v', 'e'] >>>reverse_list (lst, 0, 3) >>> lst ['e', 'v', 'i', '2'] >>> lst [] >>>reverse_list (lst, 0, 0) >>> lst [0] >>> Ist = [] >>> reverse_list (lst, 0, 1) Traceback (most recent call last): IndexError #1 #1

Language: C++  Write a Program with Comments for your code to improve quick sort. The quick sort algorithm presented in the ClassNotes-Sorting selects the first element in the list as the pivot. Revise it by selecting the median among the first, middle, and last elements in the list. Code to be revised: #include <iostream>using namespace std; // Function prototypesvoid quickSort(int list[], int arraySize);void quickSort(int list[], int first, int last);int partition(int list[], int first, int last); void quickSort(int list[], int arraySize){quickSort(list, 0, arraySize - 1);} void quickSort(int list[], int first, int last){if (last > first){int pivotIndex = partition(list, first, last);quickSort(list, first, pivotIndex - 1);quickSort(list, pivotIndex + 1, last);}} // Partition the array list[first..last]int partition(int list[], int first, int last){int pivot = list[first]; // Choose the first element as the pivotint low = first + 1; // Index for forward searchint high = last;…

This sorting function and the merge one is very similar can someone help please? its in C++