1. \(1^{st}\) array of size 5
\(2^{nd}\) array of size 10
\(1^{st}\) array is fully populated and in sorted condition. \(2^{nd}\) array has 5 elements in sorted condition.
Merge these 2 into 2nd array in sorted form. Make sure no new memory usage and less no of CPU cycles