(Sort names with duplicates) Write a program that reads the names from the 10 files described in Programming Exercise, sorts all names (boy and girl names together, duplicates allowed), and stores the sorted names in one file, 10 per line.
Programming Exercise (Baby name popularity ranking) The popularity ranking of baby names from years 2001 to 2010 are downloaded from www.ssa.gov/oact/Babynames and stored in files named Babynameranking2001.txt , Babynameranking2002.txt , …, and Babynameranking2010.txt. Each file contains one thousand lines. Each line contains a ranking, a boy’s name, number for the boy’s name, a girl’s name, and the number for the girl’s name. For example, the first two lines in the file Babynameranking2010.txt are as follows:
![]()
So, the boy’s name Jacob and girl’s name Isabella are ranked #1 and the boy’s name Ethan and girl’s name Sophia are ranked #2. 21,875 boys are named Jacob and 22,731 girls are named Isabella. Write a program that prompts the user to enter the year, gender, followed by a name, and displays the ranking of the name for the year. Here is a sample run:


We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.