In c++ please help.
2. Implement the recursive version of a. Merge sort b. Quick sort and Show transcribed image text 2. Implement the recursive version of a. Merge sort b. Quick sort and
Answer
`Hey,
Note: Brother in case of any queries, just comment inbox I would be very happy to assist all your queries
a)
#include<cstdlib>
#include<iostream>
using namespace std;
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m –
OR
OR