Given two sorted arrays $x$ and $Y$ of size $m$ and $n$ each, where $mn.$ The $x$ has exactly $n$ empty cells, merge elements of $Y$ in their correct position in array $,$ i$.$e$.,$ merge $(x,Y)$ by keeping the sorted order. The arrays are consisting of positive integers greater than $0.$ The empty cells in $x$ are represented by $0.$

Example Input:

$x[]=\{0,1,0,3,0,5,0,0,6\}$

$Y[]=\{2,4,8,10,15\}$

Example Output:

$x[]=\{1,2,3,4,5,6,8,10,15\}$

Write a function to solve this problem. Your function should take the arrays $x[]$ and $Y[]$ as input parameters and return $.$ Do not use any extra array to solve the problem. Describe the time and space complexity of your algorithm.