C ar Design write an efficient function that www integers in the way have the same b e wa Ohi ) me they don de you should return 1. because and have the same buteve, but they n o t contain the value 3 (or any other value for that m e same absolute value, but they is o re than once are tree to make calls to have dis h think will be yo s Pcm eliciently. Just be chr e ven clearly functions are doing, or leave a brief comment saying what functions you're calling You may assume the array is non-NULL and non-empty (ie, it contains at least one element) Credit for this problem will be based in part on how efficient your soution is in terms of big-brune). De no se recursion. Do not use abs(function. The function signature is int absolute Duplicates tint array. In int absolute Duplicate (int & array , int n) { int i, j =0,kio; for(i=0;i