Write a C$++$ recursive function named replace that takes an array of

integers, its size, and two integers x and y$,$ and replaces all the occurrences of x

in the array with y$.$ For example, replace$($arr$,5,0,1)$ where arr is

$\{2,0,5,6,0\}$ should change arr to $\{2,1,5,6,1\}.$