Q$6$ rou are given an array $A$ of size $N.$ Write a $C$ program to replace every element of an array with the nert greatest element $($greatest element on its right side$)$ in the array. Also, since there is no element next to the last element, replace it with $-1.($C program is expected$)$