$($Duplicate Elimination$)$ Use a one$-$dimensional array to solve the following problem. Read in $20$ numbers, each of which is between $10$ and $100,$ inclusive. As each number is read, validate it and store it in the array only 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.

$($Salesperson Salary Ranges$)$ Use a one$-$dimensional array to solve the following problem. A company pays its salespeople on a commission basis. The salespeople each receive $$200$ per week plus $9$ percent of their gross sales for that week. For example, a salesperson who grosses $$5000$ in sales in a week receives $$200$ plus $9$ percent of $$5000,$ or a total of $$650.$ Write a program $($using an array of counters$)$ that determines how many of the salespeople earned salaries in each of the following ranges $($assume that each salesperson$$s salary is truncated to an integer amount$)$:

a$)$ $$200299$

b$)$ $$300399$

c$)$ $$400499$

d$)$ $$500599$

e$)$ $$600699$

f$)$ $$700799$

g$)$ $$800899$

h$)$ $$900999$

i$)$ $$1000$ and over