Develop three C++ methods that implement the below three sorting algorithms described in the book. Your code should match with the exact algorithms described in the book. I have provided a supplementary document with three sorting algorithms that you need to implement here.

MERGE SORT Insertion Sort: MERGE-SORT (A, p,r) 1 if p 0 and A[i] > key MERGE(A, p.q,r) A[i+1 ] key I n,-q-p+1 3 let L[1..n1 and Rn2 + 1] be new arrays 4 for ton QUICK SORT PARTITION(array A, int p, int r) 1 x ? A[r] D Choose pivot 6 for j1 to n2 3 for j ? p to r-1 4 do if (AD S ) then i ? i + 1 exchange Ali] 6 7 exchange Ali + 1] 8 return1 10 i=1 12 for k-p to r 13 if Li Rjl 15 16 else A[k]=R[j] An QUICKSORT array A, int p, int r) 1 if (p