<prompt> Kutokana na idadi nzima safu, hoja 0 wote hadi mwisho wake wakati kudumisha mpangilio wa kipekee wa vipengele zisizo sifuri. Kumbuka kwamba lazima kufanya hii katika mahali bila kufanya nakala ya safu.  <response>: You can use the two-pointer technique to solve this problem. Initialize two pointers, i and j, where i starts from 0 and j starts from the first occurrence of 0 in the array.Iterate through the array with the i pointer. If the element is not zero, swap it with the element at index j and increment j.After the iteration, all the non-zero elements will be at the beginning of the array in their original order, and all the zeros will be at the end.Heres the code to implement this algorithm:void moveZeroesvector nums int n nums.size; int j 0; for int i 0; i n; i if numsi ! 0 swapnumsi, numsj; j; 