Hello,

I was looking in the textbook solutions sections under book Absolute C++ 6th edition by Walter Savitch for an answer to Chapter 5 Program Project 17 on page242, and it looks like it has not been solved yet. I then when and looked at Programming Project 12 from chapter 2 to see if that could help me figure it out and I saw that that wasn't answered yet either. Could I please get some assistance with Chapter 5 programming project 17? I have posted the problem below:

Programming Project 2.12 asked you to explore Benfords Law. An easier way to write the program is to use an array to store the digit counts. That is, count[0] might store the number of times 0 is the first digit (if that is possible in your data set), count[1] might store the number of times 1 is the first digit, and so forth. Redo Programming Project 2.12 using arrays.