3 Sorting without merging. The following function sorts the array A[] between the indices p and r (inclusive). There are no intentional syntax errors or bugs in the code int Mergeless (int AO, int p, int r) i int n, ql, q2, i, j. max1, max2 // Base Case: use InsertionSort if (r - p