Worst Case Analysis

All of you must have heard of merge sort while learning sorting algorithms. So, now is time to explore it more. Let us consider the following merge function in the merge sort algorithm: (Assume 1-base indexing) void merge(int a[], int b[], int n1, int n2, int c[]) /* Function to merge the 2 arrays a[1..n1] and b[1..n2] into array c[1..n1+n2] */ { int i = 1, j = 1, k = 1; while (i Now, in the fun