Develop an algorithm for finding the most frequently occurring value in an array of numbers. Use a sequence of coins. Place paper clips below each coin that count how many other coins of the same value are in the sequence. Give the pseudocode for an algorithm that yields the correct answer, and describe how using the coins and paper clips helped you find the algorithm. Write code that fills an array double values$[10]$ with each set of values below.

a$\mathrm{.}12345678910$

b$\mathrm{.}02468101214161820$

c$\mathrm{.}149162536496481100$

d$\mathrm{.}0000000000$

e$\mathrm{.}14916974911$

f$\mathrm{.}0101010101$

g$\mathrm{.}0123401234$