Field Tiredness Map (FTM)Project

please write the code in c++

Outline: In this project, you are expected to write a program that calculates and keeps the tirednessof a rectangular field as a 2D int array (tirednessMap) given the information about which parts of the field has been planted in the pField Tiredness Map (FTM)ProjectField Tiredness Map (FTM)ProjectField Tiredness Map (FTM)Projectrevious years. The program will read the name of the file as a stringwhich holds the planting input. The file will contain the following information: First the horizontal size of the rectangular field (sizeX) and the vertical size of the rectangular field (sizeY) will be given as intvalues. Then, a planting information will be given for each previous year as an information block. The information block will start with theyear information (currentYear) and how many plantings have been made during that year (plantingCount), both as intvalues. Next, plantingCount many planting information will be given as 4 inttuples: startXCoord, startYCoord, endXCoord, and endYCoordrepresenting this smaller rectangular area has been planted in this year.This currentYear plantingCount and that many plantingCount information blocks will keep continuing for each subsequent year until the currentYears value becomes 2017 which will be the last information block.Example inputfile:10 8201520 0 5 57082201610 0 5 52017 20 0 3 37 0 82Each information will be given IN A SINGLE LINEwithin the file as seen in the example above.Using this information, your program will calculate the tiredness of each part of the 2D rectangular field as follows: Each cell in the 2D int array will represent the tiredness of that part of the field.The tiredness of each part starts at 0.The tiredness of each part increases by 1 every year the field has been planted.The tiredness of each part decreases by 1 every year the field has NOT been planted to a minimum of 0.Example output tiredness map for the inputgiven above:33331101103333110110333311011033331100001111110000111111000000000000000000000000

Input: The horizontal size of the fieldThe vertical size of the fieldYearly information block:oStarting with year information and number of plantings in that yearoThen the top left and bottom right coordinates of each planting in that yearOutput:The tiredness map of the whole field as a 2D int arrayNOTE: The coordinates of the top left corner part of the map is 0,0 and the maximum size of the field is 40, 40NOTE: No plantings given for the same year can overlap with one another.NOTE: You MUSTuse relativeaddress for the input file and put the file in the folder where your executable is.HINT: You should start with a 2D array where the value of EACHcell is 0.HINT: While calculating the map for the next year, using a temporary second 2D arrayis STRONGLY SUGGESTED(e.g., tirednessMap, newTirednessMap)

Outline: In this project, you are expected to write a program that calculates and keeps the tiredness of a rectangular field as a 2D int array (tirednessMap) given the information about which parts of the field has been planted in the previous years. The program will read the name of the file as a string which holds the planting input. The file will contain the following information: First the horizontal size of the rectangular field (size) and the vertical size of the rectangular field (size Y will be given as int values. Then, a planting information will be given for each previous year as an information block. The information block will start with the year information (current Year) and how many plantings have been made during that year (plantingCount), both as int values. Next, plantingCount many planting information will be given as 4 int tuples: start XCoord, start Y Coord, end XCoord, and end Y Coord representing this smaller rectangular area has been planted in this year. This current Year plantingCount and that many plantingCount information blocks will keep continuing for each subsequent year until the current Year's value becomes 2017 which will be the last information block Example input file: 108 20152 0055 7082 20161 0055 2017 2 0033 7082 3 3 1 1 0 0 Each information will be given IN A SINGLE LINE within the file as seen in the example above. Using this information, your program will calculate the tiredness of each part of the 2D rectangular field as follows: Each cell in the 2D int array will represent the tiredness of that part of the field. The tiredness of each part starts at 0. The tiredness of each part increases by 1 every year the field has been planted. The tiredness of each part decreases by 1 every year the field has NOT been planted to a minimum of 0. Example output tiredness map for the input given above: 3 3 1 1 3 3 1 1 3 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 1 1 0 1 0 3 3 3 1 1 0 0 1 0 3 3 3 1 1 0 1 1 1 1 1 0 lo 1 1 1 0 0 Input: The horizontal size of the field The vertical size of the field Yearly information block o Starting with year information and number of plantings in that year Then the top left and bottom right coordinates of each planting in that year Output: The tiredness map of the whole field as a 2D int array NOTE: The coordinates of the top left comer part of the map is 0,0 and the maximum size of the field is 40.40 NOTE: No plantings given for the same year can overlap with one another. NOTE: You MUS use relative address for the input file and put the file in the folder where your executable is. HINT: You should start with a 2D array where the value of EACH cell is 0. HINT: While calculating the map for the next year, using a temporary second 2D array is STRONGLY SUGGESTED (e.g., tirednessMap, newTirednessMap). Sample Input/Outputs: Input File Contents (filename should be the Output same as in the input) fieldInfo1.txt 55 00011 2016 2 02210 0022 02 210 1344 02220 2017 2 00000 1133 3040 fieldInfo2.txt 10 10 0000000000 20143 0000000044 2227 002000 5487 0000000044 8193 0000 20153 000 22220 2227 000 00000 5487 0000000000 8193 0000000001 2016 4 0000000001 0022 3869 5485 8193 20172 8193 98 99 fieldInfo3.txt 55 00000 20141 00000 0022 00000 20151 00000 0022 00000 20160 20170