To produce the map, your program needs to parse the file and instantiate a Coordinate object for eachinputline. Subsequently,aNodeobjectshouldbecreatedfromeachCoordinateobject. The implementation should include a function named convertCoordinate responsible for mapping a latitude to a row number and a longitude to a column number for a given Node and Coordinate. Following this, the program should insert the Node object into a sorted array or vector, maintaining the sorting based on row number and then column number.

After processing all the boundary coordinates, the program should iterate through the entire ar$-$ ray or vector to generate the boundary map. To facilitate Node insertion, the implementation should include an insertNode function that takes an array or vector of Nodes. Additionally, an isNodeLessThan function must be written to internally compare two Nodes, aiding the insertN$-$ ode function in determining the correct position for inserting a new Node.