1221

k=i=j=0;
while (i<n && j<m)
{
 if (a[i] <b[j])
  {
    c[k]=a[i];
    i++;
   }
 else
    {
      c[k]=b[j];
      j++;
     }
    k++;
    }
while (i<n)
      {
       c[k]=a[i]; c++; a++;
      }
 while ( j<m)
       {
        c[k]=b[j]; c++; b++;
        }