PLEASE ANSWER ASAP, LIKE WILL BE PROMISELY GIVEN.

NEEDED IN C++

PROGRAM WILL READ FROM A TEXT FILE THE INPUTS IN THE TEXT FILE

USE ARRAYS NOT VECTORS

PROVIDE INPUT AND OUTPUT SCREENSHOTS

PLEASE DO NOT REUSE FROM DIFFERENT CHEGG QUESTION POSTED BEFORE DO NOT REUSE CODE DO NOT REUSE CODE OR PARAPHRASE CODE, WRITE YOUR OWN CODE OTHERWISE DISLIKE WILL BE GIVEN.

THANK YOU! LIKE WILL BE GIVEN IF DONE RIGHT.

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 (sizeX) and the vertical size of the rectangular field (sizeY) 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: startXCoord, start Y Coord, endXCoord, and endYCoord representing 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 current Year's value becomes 2017 which will be the last information block. Example input file: 108 2015 2 0055 7082 20161 0055 2017 2 0033 7082 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 O. 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 3 3 3 1 1 0 1 1 0 3 3 3 3 1 1 0 1 1 0 3 3 3 3 1 1 0 1 1 0 3 3 3 3 1 1 0 0 0 0 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 00 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 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 O 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 corner 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 MUST 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, new TirednessMap). Sample Input/Outputs: Input Output fieldInfol.txt 00011 02210 02210 0 2 2 20 00000 fieldInfo2.txt File Contents (filename should be the same as in the input) 55 2016 2 0022 1344 2017 2 1133 3040 10 10 20143 22 27 54 8 7 8193 20153 22 27 5487 8193 2016 4 0022 3869 5 485 8193 20172 8193 98 99 55 2014 1 00 2 2 2015 1 0 0 2 2 2016 0 2017 0 0000000000 0000000044 0020000044 0000000044 00000222 20 00000 2 2 2 2 0 0000000000 0000000000 00 00001 0000000001 fieldInfo3.txt 00000 00000 00000 00000 00000