c++

C++ program that consists of two files: [login to view URL] and [login to view URL] A. [login to view URL] The program will create a file of names stored in alphabetical order. The names will be initially entered from the keyboard and stored in array. The names will be entered in such a way so that alphabetical order is maintained. Usage: ./[login to view URL] [login to view URL] array_size argv[1] is the file name. argv[2] is the array size. The program will use a function to transform argv[2] into an integer. It will then create a string array of the size stored in argv[2] and ask the user argv[2] times for a last name, storing each in the array. You must be careful that the names, though not necessarily entered in alphabetical order, are stored in alphabetical order. For example, suppose the array had the names “Gallo” and “Hartman in the 0th and 1st positions and the next name entered is “Go.” Hartman would be moved to the 2nd position, which is currently empty, and Go placed in the first. At the end of the process, the names will be in alphabetical order. After the names have been entered and stored in the array, the contents of the array written to the file whose name is found in argv[1]. B. [login to view URL] The program will read the file created in Part A into an array. It will then ask the user to enter a name and user binary search to determine if the name is in the array. Usage: ./[login to view URL] [login to view URL] array_size argv[1] is the file name. argv[2] is the array size. The program will use a function to transform argv[2] to an integer and create a string array of the size stored in argv[2]. The program will then open the file whose name is found in argv[1] and read the names stored there into the array. Now the program will go into a loop. It will ask the user to enter the name he/she is looking for. The program will use binary search to search the array for that name. If found, the program will display “found.” If not found the program will display “not found.” The program will repeat this process until the user enters “$quit$,” at which time it will exit. The programs must be decomposed into functions that do a single task.