Write a function that receive one$-$dimensional array to solve the following probl XG$17$ em$.$ Read in $10$ numbers, each of which is between $5$ and $150,$ inclusive. As each number is read, validate it and store it in the array only if a number isn't divisible by $2$ or $3$ and if it isn$$t a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Provide for the $$worst case$$ in which all $20$ numbers are different. Use the smallest possible array to solve this problem.