Implement code to check if all the elements of an array are distinct (no repetition of values). Give an estimate to the number of times the basic operation (comparison) is executed as an upper bound for the worst-case using asymptotic notation (Big O). Note: Use input array of size 32 or greater. Please use C++ or C language