Please help me with this code becuase I dont think my output is correct.QUENEMAIN.CPP#include <iostream>#include <fstream>#include <cstdlib>#include <string>#include <stdexcept>#include <cassert>#include "LinkedQueue.h"using namespace std;/*** Name of input file containing officer names*/const char INPUT_FILE[] = "Alamo.csv";/*** Inputs data from a text file and places each officer's name into the* queue passed as a parameter.* @param officers - dynamic queue of Confederate officers in the Civil War*/void loadQueue(LinkedQueue<string> &officers);/*** Displays a list of officers removed from the queue and also displays* the name of the officer going for help. Retrieves officers from the * officers queue, one at a time, counting as each is retrieved. If the * count is not equal to hatNumber, the officer is put back into the* queue. When the count reaches hatNumber, that officer is removed from* the queue permanently (i.e., not put back into the queue), and the* officer's name is output to the screen. The last officer remaining in* the queue is the one shown as going for help.* @param officers - dynamic queue of Confederate officers in the Civil War* @param hatNumber - the number drawn from the hat, used to count off*/void countOff(LinkedQueue<string> officers, int hatNumber);int main(void) {ifstream inFile(INPUT_FILE); // declare and open the input fileint count; // number used for counting offLinkedQueue<string> officers; // queue containing officer namesstring officerName; // name of officer in front of queuestring firstName; // name of first officer in original queueloadQueue(officers);// Display list of officers in original queuecout << "_______________________________" << endl;cout << "OFFICERS IN THE ORIGINAL QUEUE: " << endl;cout << "-------------------------------" << endl;firstName = officers.peekFront();cout << firstName << endl;officers.dequeue();officers.enqueue(firstName);officerName = officers.peekFront();while (firstName != officerName) {cout << officerName << endl;officers.dequeue();officers.enqueue(officerName);officerName = officers.peekFront();}// Test countOff() method using various numbers drawn from the hatcount = 4;cout << endl << endl << "COUNT IS: " << count << endl;countOff(officers, count);// count = 8;// cout << endl << endl << "COUNT IS: " << count << endl;// countOff(officers, count);return EXIT_SUCCESS;}void loadQueue(LinkedQueue<string> &officers) {ifstream inFile(INPUT_FILE); // declare and open the input filestring officerName; // name of officer input from fileif (!inFile)cout << "Error opening file for input: " << INPUT_FILE << endl;else {getline(inFile, officerName); //read https addressgetline(inFile, officerName); //read headersgetline(inFile, officerName); //reads first namewhile (!inFile.eof()) {officers.enqueue(officerName);getline(inFile, officerName);}inFile.close();}}void countOff(LinkedQueue<string> officers, int count) { //write your code here} During the Battle at the Alama a the defenders suddowdicovered thcy ore surrounded by an overwhelming force.There is absolutely iso hope for victory without renforcements nd David Ciockett's horse is the only horse availablethut Can be used to escape and smon help. The defenders are toact to detemmine which of them is to go forhielpThe defenders forma queue and thev pick a nunbor ficmahil. Beghning with the frst officer in the queue, they beginto count, As each defender counts of, he moves to the ondiof the quoue When the count reaches the number that waspicked, that defender is nemoved froni the ueue, and the icount besagaln with De ot nan Once an defender isremoved trom the queue, he is no longer couned The list defender tha s i the quieue is the one that ddesaway on the horse to sumon helpFor example, let's suppose the following defenders are stoeeid in the oubuttJan Abamilo SGT, Texas, fatalityJames L Alen PVT, Kentucky. survivorRobert Alen. PVT, Virgria fatltvHorace Alsbury. PVT, Kentucky, sunvorGeorge Andrews ataltyMiles Deforest Andross PVT Vermont, fataltyJose Maris Arocha urvivorSimon Arreola.survivorMicaah Autry. PVT, North Carblina fatyJessie B. Badgett Tes sunivorJuanA Badilio, SGT, Te tatalityPeter Janes Balieysac G Baker.PVT. Aikatsa litaltyWilla Chares M Baker CPT.Msoun fatityJohn laadPVT Kentucky YataityJohn lentine PVT. Pernsytvaria faalityRichard W Bllertine PVT, Scotird, fataltyLets alvo uppiose the rumber oicked fsh the hat is 4 S6dthe queuecounting off and inong to the back ofAttilo 2Aen AlenNext is AsburyY d he is4.Since that is the numberd teom the h hePdhe will no be the defonder that goes belpSWNtle. he b eot pt back into theNow. wt bnounting gainHA 2Ad 2-Arochasobe abo wals way. We bn countirg agan1-Autri2:0adgett 3-BaElley is 4 soGker PVT Akans fataltywia Chines M Baket CPT.Mioul.fataleyJohiniJohnRichard W. Bilertin PVT Scotand, fataltywaks aay The ueue cunesdy lookse thisPVt Pesvar taete Sat TestattyLAles PVC KentucksuniverfatalityRobert Alen,PVTGeorgeMiks DeFort dros. Pt Veno fataltyJose MarMan Aury NT, North Cin layJesse B BadeetatySGT Teas fatalityThe processUNS Way unt only one defender remains in the queue. The last defender remaining in the The countOff() method displays the name of each officer removed from the queue, in the order in which they areremoved, and displays the name of the officer that goes for help. For example, the output for the queue of defendersabove with a count of 4 would appear as:Defenders leaving the queue are:Horace Alsbury, PVT, Kentucky, survivorSimon Arreola, – survivorPeter James Bailey III, PVT. Kentucky, fatalityJohn J. Ballentine, PVT, Pennsylvania, fatalityRobert Allen: PVT, Virginia, fatalityMicajah Autry, PVT, North Carolina, fatalityWilliam Charles M. Baker, CPT, Missouri, fatalityJames LAllen, PVT, Kentucky, survivorJesse B. BadgettRichard W. Ballentine, PVT, Scotland, fatalityTexas, survivorJosé María Arocha:survivorJuan Abamillo, SGT, Texas, fatalityIsaac G. Baker, PVT, Arkansas, fatalityJuan A. Badillo, SGT, Texas, fatalityJohn Ballard, -,fatalityMiles DeForest Andross, PVT, Vermont, fatalityThe defender going for help is: Gebrge Andrews, fatalityThe countOff) method cannot create a data structure; it MUST use the LinkedQueue data structure named officers,which is passed as an argument. QueueMain.cpp contains maint) function that you can choose to use, or you can writeyour own, The downloaded folder also contains main.cpp which was used to test the functions in the LinkedQueue classif you want to take a look at it.

void countOff (LinkedQueue < string > officers, int count){ int theCount = 1; string…

Please help me with this code becuase I dont think my output is correct. QUENEMAIN.CPP #include #include #include #include #include #include #include "LinkedQueue.h" using namespace std; /** * Name of input file containing officer names */ const char INPUT_FILE[] = "Alamo.csv"; /** * Inputs data from a text file and places each officer's name into the * queue passed as a parameter. * @param officers - dynamic queue of Confederate officers in the Civil War */ void loadQueue(LinkedQueue &officers); /** * Displays a list of officers removed from the queue and also displays * the name of the officer going for help. Retrieves officers from the * officers queue, one at a time, counting as each is retrieved. If the * count is not equal to hatNumber, the officer is put back into the * queue. When the count reaches hatNumber, that officer is removed from * the queue permanently (i.e., not put back into the queue), and the * officer's name is output to the screen. The last officer remaining in * the queue is the one shown as going for help. * @param officers - dynamic queue of Confederate officers in the Civil War * @param hatNumber - the number drawn from the hat, used to count off */ void countOff(LinkedQueue officers, int hatNumber); int main(void) { ifstream inFile(INPUT_FILE); // declare and open the input file int count; // number used for counting off LinkedQueue officers; // queue containing officer names string officerName; // name of officer in front of queue string firstName; // name of first officer in original queue loadQueue(officers); // Display list of officers in original queue cout << "_______________________________" << endl; cout << "OFFICERS IN THE ORIGINAL QUEUE: " << endl; cout << "-------------------------------" << endl; firstName = officers.peekFront(); cout << firstName << endl; officers.dequeue(); officers.enqueue(firstName); officerName = officers.peekFront(); while (firstName != officerName) { cout << officerName << endl; officers.dequeue(); officers.enqueue(officerName); officerName = officers.peekFront(); } // Test countOff() method using various numbers drawn from the hat count = 4; cout << endl << endl << "COUNT IS: " << count << endl; countOff(officers, count); // count = 8; // cout << endl << endl << "COUNT IS: " << count << endl; // countOff(officers, count); return EXIT_SUCCESS; } void loadQueue(LinkedQueue &officers) { ifstream inFile(INPUT_FILE); // declare and open the input file string officerName; // name of officer input from file if (!inFile) cout << "Error opening file for input: " << INPUT_FILE << endl; else { getline(inFile, officerName); //read https address getline(inFile, officerName); //read headers getline(inFile, officerName); //reads first name while (!inFile.eof()) { officers.enqueue(officerName); getline(inFile, officerName); } inFile.close(); } } void countOff(LinkedQueue officers, int count) { //write your code here }